Related papers: Hamiltonian paths on the Sierpinski gasket

A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to…

We generalize our earlier work on the symplectic/Hamiltonian formulation of the dynamics of the Gaussian wave packet to non-Gaussian semiclassical wave packets. We find the symplectic forms and asymptotic expansions of the Hamiltonians…

In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…

We show that if we color the hyperedges of the complete $3$-uniform complete graph on $2n+\sqrt{18n+1}+2$ vertices with $n$ colors, then one of the color classes contains a loose path of length three.

We show that if $n$ is odd and $p \ge C \log n / n$, then with high probability Hamilton cycles in $G(n,p)$ span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties.…

We construct a new aperiodic symplectic plug and hence new smooth counterexamples to the Hamiltonian Seifert conjecture in R^{2n} for n>2. In other words, we develop an alternative procedure, to those of V. L. Ginzburg and M. Herman, for…

When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example one could decide whether a Hamiltonian path exists for a fixed starting…

We calculate the spectrum of Lyapunov exponents for a point particle moving in a random array of fixed hard disk or hard sphere scatterers, i.e. the disordered Lorentz gas, in a generic nonequilibrium situation. In a large system which is…

We confirm, in a more general framework, a part of the conjecture posed by R. Bell, C.-W. Ho, and R. S. Strichartz [Energy measures of harmonic functions on the Sierpi\'nski gasket, Indiana Univ. Math. J. 63 (2014), 831--868] on the…

New types of stationary solutions of a one-dimensional driven sixth-order Cahn-Hilliard type equation that arises as a model for epitaxially growing nano-structures such as quantum dots, are derived by an extension of the method of matched…

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…

For a nearly integrable Hamiltonian systems $H=h(p)+\epsilon P(p,q)$ with $(p,q)\in\mathbb{R}^3\times\mathbb{T}^3$, large normally hyperbolic invariant cylinders exist along the whole resonant path, except for the…

The nonlinear Schr\"odinger/Gross-Pitaevskii (NLS/GP) equation is considered in the presence of three equally-spaced potentials. The problem is reduced to a finite-dimensional Hamiltonian system by a Galerkin truncation. Families of…

The transparent way for the invariant (Hamiltonian) description of equivariant localization of the integrals over phase space is proposed. It uses the odd symplectic structure, constructed over tangent bundle of the phase space and permits…

We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative its size. These…

In classical kinetic or kinetic-like models a particle free path distribution is exponensial, but this is more likely to be an exception than a rule. In this paper we derive a linear Boltzmann-like equation for a general free path…

We study the symplectic geometry of the moduli spaces $M_r=M_r(\s^3)$ of closed n-gons with fixed side-lengths in the 3-sphere. We prove that these moduli spaces have symplectic structures obtained by reduction of the fusion product of $n$…

We investigate the asymptotic behavior of the free path of a variable density random flight model in an external field as the initial velocity of the particle goes to infinity. The random flight models we study arise naturally as the…

Fix $d \ge 3$. We show the existence of a constant $c>0$ such that any graph of diameter at most $d$ has average distance at most $d-c \frac{d^{3/2}}{\sqrt n}$, where $n$ is the number of vertices. Moreover, we exhibit graphs certifying…

Motivated by the study of attractors in the Kuramoto model (KM) on graphs approximating the Sierpinski gasket (SG), we revisit the problem of harmonic maps (HMs) from SG to the circle, first considered by Strichartz. We provide a geometric…