Related papers: Hamiltonian paths on the Sierpinski gasket

We prove that a complete multipartite graph $K$ with $n>1$ vertices and $m$ edges can be decomposed into edge-disjoint Hamilton paths if and only if $\frac m{n-1}$ is an integer and the maximum degree of $K$ is at most $\frac {2m}{n-1}$.

We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…

Following a problem posed by Lov\'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a $(2,s,3)$-presentation, that…

A random Heegaard splitting is a 3-manifold obtained by using a random walk of length n on the mapping class group as the gluing map between two handlebodies. We show that the joint distribution of random walks of length n and their…

Let $X_i = {X_i(t), t \in T}$ be i.i.d. copies of a centered Gaussian process $X = {X(t), t \in T}$ with values in $\mathbb{R}^d$ defined on a separable metric space $T.$ It is supposed that $X$ is bounded. We consider the asymptotic…

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

Warped dS$_3$ arises as a solution to topologically massive gravity (TMG) with positive cosmological constant $+1/\ell^2$ and Chern-Simons coefficient $1/\mu$ in the region $\mu^2 \ell^2 < 27$. It is given by a real line fibration over…

We analyze a quasi-continuous linear chain with self-similar distribution of harmonic interparticle springs as recently introduced for one dimension (Michelitsch et al., Phys. Rev. E 80, 011135 (2009)). We define a continuum limit for one…

We investigate the spectral properties of the Dirichlet Laplacian on large finite metric balls within irregular infinite graphs of quadratic volume growth. We consider an exhaustion $G_n = B_{R_n}(x_0)$ and the spectral zeta value $Z_n(1) =…

The restrictions of a harmonic function on the Sierpinski Gasket (SG) to the segments in SG have been of some interest. We show that the sufficient conditions for the monotonicity of these restrictions given by Dalrymple, Strichartz and…

In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…

Starting from a travelling wave ansatz we show successively that the shape of a nonlinear excitation generally depends also on the 1st, 2nd, ... time derivative of the position X of the excitation. From the Hamilton equations we derive a…

We determine the sharp threshold for Hamilton cycles in randomly perturbed sparse graphs. For any $\alpha=\alpha(n)=o(1)$, let $G_{\alpha}$ be an $n$-vertex graph with minimum degree $\delta(G_{\alpha})\ge\alpha n$. We prove that if…

This paper develops the hybridizable discontinuous Galerkin (HDG) method for the Ostrovsky equation, a nonlinear dispersive wave equation featuring both third-order dispersion and a nonlocal antiderivative term with Coriolis effect. On a…

The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ denotes the subspace of $C(G)$, spanned by the…

Explicit and semi-explicit geometric integration schemes for dissipative perturbations of Hamiltonian systems are analyzed. The dissipation is characterized by a small parameter $\epsilon$, and the schemes under study preserve the…

In this paper, we study the longtime asymptotic behavior of a phase separation process occurring in a three-dimensional domain containing a fluid flow of given velocity. This process is modeled by a viscous convective Cahn-Hilliard system,…

Let $\mathcal{G}(n,r,s)$ denote a uniformly random $r$-regular $s$-uniform hypergraph on $n$ vertices, where $s$ is a fixed constant and $r=r(n)$ may grow with $n$. An $\ell$-overlapping Hamilton cycle is a Hamilton cycle in which…

Let $p$ be a prime and $n$ a positive integer such that $\sqrt{\frac p2} + 1 \leq n \leq \sqrt{p}$. For any arithmetic progression $A$ of length $n$ in $\mathbb{F}_p$, we establish an asymptotic formula for the number of directions…

We establish an asymptotic formula for the number of lattice points in the sets \[ \mathbf S_{h_1, h_2, h_3}(\lambda): =\{x\in\mathbb Z_+^3:\lfloor h_1(x_1)\rfloor+\lfloor h_2(x_2)\rfloor+\lfloor h_3(x_3)\rfloor=\lambda\} \quad…