Related papers: On four state Hard Core Models on the Cayley Tree
Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$-partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary…
It is shown that any two Hamiltonians H(t) and H'(t) of N dimensional quantum systems can be related by means of time-dependent canonical transformations (CT). The dynamical symmetry group of system with Hamiltonian H(t) coincides with the…
Hybrid dynamical systems with nonlinear dynamics are one of the most general modeling tools for representing robotic systems, especially contact-rich systems. However, providing guarantees regarding the safety or performance of nonlinear…
We establish a precise characterisation of $4$-uniform hypergraphs with minimum codegree close to $n/2$ which contain a Hamilton $2$-cycle. As an immediate corollary we identify the exact Dirac threshold for Hamilton $2$-cycles in…
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…
We consider the problem of testing if two input forests are isomorphic or are far from being so. An algorithm is called an $\varepsilon$-tester for forest-isomorphism if given an oracle access to two forests $G$ and $H$ in the adjacency…
We consider the soft-core Widom-Rowlinson model for particles with spins and holes, on a Cayley tree of order $d$ (which has $d + 1$ nearest neighbours), depending on repulsion strength $\beta$ between particles of different signs and on an…
In this paper is studied ferromagnetic three states Potts model on a Cayley tree of order three and we give explicit formulas for translation-invariant Gibbs measures. Furthermore, we show that under some conditions on the parameter of the…
The method of choice for describing attractive quantum systems is Hartree-Fock-Bogoliubov (HFB) theory. This is a nonlinear model which allows for the description of pairing effects, the main explanation for the superconductivity of certain…
We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…
The familiar unrestricted Hartree-Fock variational principle is generalized to include quasi-free states. As we show, these are in one-to-one correspondence with the one-particle density matrices and these, in turn provide a convenient…
We study two fundamental problems related to finding subgraphs: (1) given graphs G and H, Subgraph Test asks if H is isomorphic to a subgraph of G, (2) given graphs G, H, and an integer t, Packing asks if G contains t vertex-disjoint…
Many-body states whose wave-function admits a representation in terms of a uniform binary-tree tensor decomposition are shown to obey to power-law two-body correlations functions. Any such state can be associated with the ground state of a…
Gibbs states of an infinite system of interacting quantum particles are considered. Each particle moves on a compact Riemannian manifold and is attached to a vertex of a graph (one particle per vertex). Two kinds of graphs are studied: (a)…
We consider the following problem: Let $H$ and $F$ be two graphs on $k$ vertices and assume $F \neq H$. We say that $H$ and $F$ are incomparable if neither $F$ nor $H$ contains the other. Let $H$ be a graph on $k$ vertices and let $G$ be a…
We develop a new robust technique to deduce variance principles for non-integrable discrete systems. To illustrate this technique, we show the existence of a variational principle for graph homomorphisms from $\Z^m$ to a $d$-regular tree.…
Graphity models are characterized by configuration spaces in which states correspond to graphs and Hamiltonians that depend on local properties of graphs such as the degrees of vertices and numbers of short cycles. As statistical systems,…
Hamilton-Jacobi reachability analysis is a powerful technique used to verify the safety of autonomous systems. This method is very good at handling non-linear system dynamics with disturbances and flexible set representations. A drawback to…
A graph is $H$-free if it does not contain $H$ as a subgraph. The diamond graph is the graph obtained from $K_4$ by deleting one edge. We prove that if $G$ is a connected graph with order $n\geq 10$, then there exists a subset $S\subseteq…
We formulate a continuous version of the well known discrete hardcore (or independent set) model on a locally finite graph, parameterized by the so-called activity parameter $\lambda > 0$. In this version, the state or "spin value" $x_u$ of…