Related papers: Hamiltonian Cycles on a Random Three-coordinate La…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
We propose a model for the quantum harmonic oscillator on a discrete lattice which can be written in supersymmetric form, in contrast with the more direct discretization of the harmonic oscillator. Its ground state is easily found to be…
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…
We explore the potential application of quantum computers to the examination of lattice holography, which extends to the strongly-coupled bulk theory regime. With adiabatic evolution, we compute the ground state of a spin system on a…
In this paper, we show that "Labyrinth walks", the conservative version of "Labyrinth chaos" and member of the Thomas-R\"ossler class of systems, does not admit an autonomous Hamiltonian as a constant function in time, and as a consequence,…
We study the support (i.e. the set of visited sites) of a t step random walk on a two-dimensional square lattice in the large t limit. A broad class of global properties M(t) of the support is considered, including, e.g., the number S(t) of…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
Consider a nearest neighbor random walk on the two-dimensional integer lattice, where each vertex is initially labeled either `H' or `V', uniformly and independently. At each discrete time step, the walker resamples the label at its current…
We study a general class of PT-symmetric tridiagonal Hamiltonians with purely imaginary interaction terms in the quasi-hermitian representation of quantum mechanics. Our general Hamiltonian encompasses many previously studied lattice models…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergraphs.
We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…
We numerically study quantum chaos properties of long-range XXZ dipolar Hamiltonian spin systems. Two geometries are considered: (i) an open chain with 19 spins, (ii) a face-centered cubic lattice with 14 spins. Energy level-spacing…
We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs.
Focusing on a continuous-time quantum walk on $\mathbb{Z}=\left\{0,\pm 1,\pm 2,\ldots\right\}$, we analyze a probability distribution with which the quantum walker is observed at a position. The walker launches off at a localized state and…
We shall use symmetry breaking as a tool to attack the problem of identifying the topology of chaotic scatteruing with more then two degrees of freedom. specifically we discuss the structure of the homoclinic/heteroclinic tangle and the…
The vertex set of the kth cartesian power of a directed cycle of length m can be naturally identified with the set of k-tuples of integers modulo m. For any two vertices v and w of this graph, it is easy to see that if there is a…
The aim of this paper is to study the relationship between Hamiltonian dynamics and constrained variational calculus. We describe both using the notion of Lagrangian submanifolds of convenient symplectic manifolds and using the so-called…
We consider a random walk on a multidimensional integer lattice with random bounds on local times, conditioned on the event that it hits a high level before its death. We introduce an auxiliary "core" process that has a regenerative…
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…