Related papers: Hamiltonian Cycles on a Random Three-coordinate La…
We study the Hamiltonian dynamics and spectral theory of spin-oscillators. Because of their rich structure, spin-oscillators display fairly general properties of integrable systems with two degrees of freedom. Spin-oscillators have…
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…
We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
This manuscript is the first in a series of instalments that investigate spherically symmetric solutions within the effective dynamics program of Loop Quantum Gravity. The choice of lattice is adapted such that it remains invariant under a…
In this work we propose a new numerical approach to distinguish between regular and chaotic orbits in Hamiltonian systems, based on the simultaneous integration of both the orbit and the deviation vectors using a symplectic scheme, hereby…
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…
We enumerate labelled and unlabelled Hamiltonian cycles in complete $n$-partite graphs $K_{d,d,\ldots,d}$ having exactly $d$ vertices in each part (in other words, Tur\'an graphs $T(nd, n))$. We obtain recurrence relations that allow us to…
A square lattice distribution of coupled oscillators that have heteroclinic cycle attractors is studied. In this system, we find a novel type of patterns that is spatially disordered and periodic in time. These patterns are limit cycle…
For all integers $k$ with $k\geq 2$, if $G$ is a balanced $k$-partite graph on $n\geq 3$ vertices with minimum degree at least \[…
We consider a finite range symmetric exclusion process on the integer lattice in any dimension. We interpret it as a non-elliptic time-dependent random conductance model by setting conductances equal to one over the edges with end points…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
A complete geometric classification of symmetries of autonomous Hamiltonian mechanical systems is established; explaining how to obtain their associated conserved quantities in all cases. In particular, first we review well-known results…
This paper investigated the problem of embedding a simple Hamiltonian Cycle with n vertices on n points inside a simple polygon. This problem seeks to embed a straight-line cycle (without bends), which does not intersect either itself or…
Random walks of particles on a lattice are a classical paradigm for the microscopic mechanism underlying diffusive processes. In deterministic walks, the role of space and time can be reversed, and the microscopic dynamics can produce quite…
We present a general procedure for constructing lattices of qubits with a Hamiltonian composed of nearest-neighbour two-body interactions such that the ground state encodes a cluster state. We give specific details for lattices in one-,…
In this paper, we investigate the well-studied Hamiltonian cycle problem (HCYCLE), and present an interesting dichotomy result on split graphs. T. Akiyama et al. (1980) have shown that HCYCLE is NP-complete in planar bipartite graphs with…