Related papers: A Note on the Balanced ST-Connectivity

Given $n$ pairwise disjoint sets $X_1,\ldots, X_n$, we call the elements of $S=X_1\times\ldots\times X_n$ strings. A nonempty set of strings $W\subseteq S$ is said to be well-connected if for every $v\in W$ and for every $i\, (1\le i\le…

We construct a series of stochastic differential equations of the form $dX_t = b(t, X_t) dt + dB_t$ which exhibit nonuniqueness in the path-by-path sense while having a unique adapted solution in the sense of stochastic processes, i.e.…

A graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected…

We give a stack-theoretic proof for some results on families of hyperelliptic curves.

In this note, we prove the connectivity of the Milnor fiber for a mixed polynomial $f(\mathbf z,\bar{\mathbf z})$, assuming the existence of a sequence of smooth points of $f^{-1}(0)$ converging to the origin. This result gives also a…

We show that every two-bridge knot $K$ of crossing number $N$ admits a polynomial parametrization $x=T_3(t), y = T_b(t), z =C(t)$ where $T_k(t)$ are the Chebyshev polynomials and $b+\deg C = 3N$. If $C (t)= T_c(t)$ is a Chebyshev…

We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$, $a\geq3$, satisfying $d(u)+d(v)\geq 3a$ for every pair of vertices $u,v$ with a common in-neighbour or a common out-neighbour, is either bipancyclic or a…

This paper addresses the string stabilization of vehicular platooning when stochastic phenomena are inherent in inter-vehicle communication. To achieve this, we first provide two definitions to analytically assess the string stability in…

Let $G=P_6\Box P_6$ be the $6\times 6$ grid, the Cartesian product of two paths of six vertices. Let $T$ be the set of eight distinct vertices of $G$, called terminals, and assume that $T$ is partitioned into four terminal pairs…

In this paper we show that a generalized version of the Nikoli puzzle Slant is NP-complete. We also give polynomial time algorithms for versions of the puzzle where some constraints are omitted. These problems correspond to simultaneously…

This paper studies two-sided many-to-one matching in which firms have complementary preferences. We show that stable matchings exist under a balancedness condition that rules out a specific type of odd-length cycles formed by firms'…

Consider lattice paths in Z^2 taking unit steps north (N) and east (E). Fix positive integers r,s and put an equivalence relation on points of Z^2 by letting v,w be equivalent if v - w = m (r,s) for some m in Z. Call a lattice path valid if…

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…

In this paper, the results of part I regarding a special case of Feynman identity are extended. The sign rule for a path in terms of data encoded by its word and formulas for the numbers of distinct equivalence classes of nonperiodic paths…

Semilinear stochastic evolution equations with multiplicative L\'evy noise and monotone nonlinear drift are considered. Unlike other similar work we do not impose coercivity conditions on coefficients. Existence and uniqueness of the mild…

Let $G$ be a simple graph with $n\geq4$ vertices and $d(x)+d(y)\geq n+k$ for each edge $xy\in E(G)$. In this work we prove that $G$ either contains a spanning closed trail containing any given edge set $X$ if $|X|\leq k$, or $G$ is a well…

A parallel $d$-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex $v$, there is no subset $X \subseteq N(v)$ with $1 \leq |N| \leq d$ such that every time the walk…

The balanced hypercube, $BH_n$, is a variant of hypercube $Q_n$. R.X. Hao et al. $(2014)$ \cite{R.X.Hao} showed that there exists a fault-free Hamiltonian path between any two adjacent vertices in $BH_n$ with $(2n-2)$ faulty edges. D.Q.…

We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.

We prove that the super-linearizability of polynomial systems is preserved by all currently known classes of polynomial automorphisms of $\R^n$. We then establish connections between such automorphisms and a sufficient condition for…