Related papers: Hamiltonian Cycles on a Random Three-coordinate La…
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…
A simple periodically driven system displaying rich behavior is introduced and studied. The system self-organizes into a mosaic of static ordered regions with three possible patterns, which are threaded by one-dimensional paths on which a…
For a periodically driven quantum system an effective time-independent Hamiltonian is derived with an eigen-energy spectrum, which in the regime of large driving frequencies approximates the quasi-energies of the corresponding Floquet…
We study Hamiltonian walks (HWs) on Sierpinski and $n$--simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant $\omega$ and find the asymptotic behaviour of the…
We study the drift of slow variables in a slow-fast Hamiltonian system with several fast and slow degrees of freedom. For any periodic trajectory of the fast subsystem with the frozen slow variables we define an action. For a family of…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…
We analyze the problem of discovering long cycles inside a graph. We propose and test two algorithms for this task. The first one is based on recent advances in statistical mechanics and relies on a message passing procedure. The second…
Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…
In the worldline formalism, scalar Quantum Electrodynamics on a 2-dimensional lattice is related to the areas of closed loops on this lattice. We exploit this relationship in order to determine the general structure of the moments of the…
The vicious random walker problem on a one dimensional lattice is considered. Many walkers take simultaneous steps on the lattice and the configurations in which two of them arrive at the same site are prohibited. It is known that the…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schroedinger equation or complex wavefunctions. Unlike the standard…
We derive the dynamics of several rigid bodies of arbitrary shape in a 2-dimensional inviscid and incompressible fluid, whose vorticity field is given by point vortices. We adopt the idea of Vankerschaver et al. (2009) to derive the…
We study a new class of matrix models, formulated on a lattice. On each site are $N$ states with random energies governed by a Gaussian random matrix Hamiltonian. The states on different sites are coupled randomly. We calculate the density…
Engineering a Hamiltonian system with tunable interactions provides opportunities to optimize performance for quantum sensing and explore emerging phenomena of many-body systems. An optical lattice clock based on partially delocalized…
We present a Hamilton cycle in the $k$-sided pancake network and four combinatorial algorithms to traverse the cycle. The network's vertices are coloured permutations $\pi = p_1p_2\cdots p_n$, where each $p_i$ has an associated colour in…
In Hamiltonian systems subjected to periodic perturbations the stable and unstable manifolds of the unstable periodic orbits provide the dynamical "skeleton" that drives the mixing process and bounds the chaotic regions of the phase space.…
The Hamiltonian cycle (HC) problem in graph theory is a well-known NP-complete problem. We present an approach in terms of $\mathbb{Z}_2$ lattice gauge theory (LGT) defined on the lattice with the graph as its dual. When the coupling…
We investigate how imposing kinetic restrictions on quantum particles that would otherwise hop freely on a two-dimensional lattice can lead to topologically ordered states. The kinetically constrained models introduced here are derived as a…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
For a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that…