Related papers: On Hamilton Decompositions

In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…

A well-known conjecture of Alspach says that every $2k$-regular Cayley graph of an abelian group can be decomposed into Hamiltonian cycles. We consider an analogous question for infinite abelian groups. In this setting one natural analogue…

We show that with high probability we can build a Hamilton cycle after at most $1.85 n$ rounds in a particular semi-random model. In this model, in one round, we are given a {uniform random} $v\in[n]$ and then we can add an {arbitrary} edge…

We only consider finite structures. With every totally ordered set $V$ and a subset $P$ of $\binom{V}{2}$, we associate the underlying tournament ${\rm Inv}(\underline{V}, P)$ obtained from the transitive tournament $\underline{V}:=(V,…

Hamiltonian systems with functionally dependent constraints (irregular systems), for which the standard Dirac procedure is not directly applicable, are discussed. They are classified according to their behavior in the vicinity of the…

This work introduces a Hamiltonian approach to regularization and linearization of central-force particle dynamics through a new canonical extension of the so-called "projective decomposition". The regularization scheme is formulated within…

Lie-Trotter-Suzuki decompositions are an efficient way to approximate operator exponentials $\exp(t H)$ when $H$ is a sum of $n$ (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution…

A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…

We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…

In an ordinary billiard trajectories of a Hamiltonian system are elastically reflected after a collision with a hypersurface (scatterer). If the scatterer is a submanifold of codimension more than one, we say that the billiard is…

Consider the random graph process where we start with an empty graph on n vertices, and at time t, are given an edge e_t chosen uniformly at random among the edges which have not appeared so far. A classical result in random graph theory…

Let $P$ be a set of $n\geq 2$ points in general position in $R^2$. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in $D(P)$ if…

We show how to derive fixed-point Hamiltonians in quantum mechanics from a proposed renormalization group invariance approach that relies in a subtraction procedure at a given energy scale. The scheme is valid for arbitrary interactions…

We present the many-particle Hamiltonian model of Lipkin, Meshkov and Glick in the context of deformed polynomial algebras and show that its exact solutions can be easily and naturally obtained within this formalism. The Hamiltonian matrix…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

Stanley decompositions are used in invariant theory and the theory of normal forms for dynamical systems to provide a unique way of writing each invariant as a polynomial in the Hilbert basis elements. Since the required Stanley…

A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. Manikandan and Paulraja conjectured that if $G$ and $H$ are Hamilton cycle decomposable circulant graphs with at least one of them is…

A famous result by R\"odl, Ruci\'nski, and Szemer\'edi guarantees a (tight) Hamilton cycle in $k$-uniform hypergraphs $H$ on $n$ vertices with minimum $(k-1)$-degree $\delta_{k-1}(H)\geq (1/2+o(1))n$, thereby extending Dirac's result from…

Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…

We construct a combinatorial function F which computes the number of oriented Hamiltonian paths of any given type, in a transitive tournament. We also study many properties of F that arise, and reach some observations.