Related papers: On four state Hard Core Models on the Cayley Tree

We study the mathematical aspects of the Bose Einstein Condensation for the pure hopping model describing arrays of Josephson junctions on non homogeneous networks. The graphs under investigation are obtained by adding density zero…

In the paper we considere three state $p$-adic Potts model with competing interactions on a Cayley tree of order two. We reduce a problem of describing of the $p$-adic Gibbs measures to the solution of certain recursive equation, and using…

In this paper we study some open questions related to the smallest order $f({\cal C},\lnot {\cal H})$ of a 4-regular graph which has a connectivity property ${{\cal C}}$ but does not have a hamiltonian property ${\cal H}$. In particular,…

In this paper, we consider Vannimenus model with competing nearest-neighbors and prolonged next-nearest-neighbors interactions on a Cayley tree. For this model we define Markov random fields with memory of length 2. By using a new approach,…

Conformal field theory has turned out to be a powerful tool to derive interesting lattice models with analytical ground states. Here, we investigate a class of critical, one-dimensional lattice models of fermions and hardcore bosons related…

In this paper we complete the analysis of a statistical mechanics model on Cayley trees of any degree, started in [EsHaRo12,EsRo10,BoEsRo13,JaKuBo14,Bo17]. The potential is of nearest-neighbor type and the local state space is compact but…

Let $G$ be a graph on $n\geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H}(x,y)\leq d_{G}(x,y)+1$ for any pair of vertices $x,y\in V(H)$. A graph $G$ is called…

Any graph can be represented pictorially as a figure. Moreover, it can be represented as two or more figures that can be have different properties to each other. For the purpose of HCP, we represent a graph by two such figures. In each of…

We present an efficient algorithm for the construction of a holographic simple tree graph model that realizes a given entropy vector, subject to a specific ``chordality'' condition first introduced in arXiv:2412.18018. We further develop…

Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding…

The "Hermitizability" problem of quantum theory is explained, discussed and illustrated via the discrete-lattice cryptohermitian quantum graphs. In detail, the description of the domain ${\cal D}$ of admissible parameters is provided for…

In 1984, Fan gave a sufficient condition involving maximum degree of every pair of vertices at distance two for a graph to be Hamiltonian. Motivated by Fan's result, we say that an induced subgraph $H$ of a graph $G$ is $f$-heavy if for…

We consider an SOS (solid-on-solid) model, with spin values from the set of all integers, on a Cayley tree of order k and are interested in translation-invariant gradient Gibbs measures (GGMs) of the model. Such a measure corresponds to a…

In this paper we consider translation-invariant Gibbs measures for the Blum-Kapel model on a Cayley tree of order k. An approximate critical temperature T_{cr} is found such that for T\geq T_{cr} there exists a unique translation-invariant…

This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…

The question of open-loop control in the Gaussian regime may be cast by asking which Gaussian unitary transformations are reachable by turning on and off a given set of quadratic Hamiltonians. For compact groups, including finite…

We show that thermal states of local Hamiltonians are separable above a constant temperature. Specifically, for a local Hamiltonian $H$ on a graph with degree $\mathfrak{d}$, its Gibbs state at inverse temperature $\beta$, denoted by $\rho…

This work is devoted to description of all translation-invariant $p$-adic Gibbs measures for the $q$-state Potts model on a Cayley tree. In particular for the Cayley tree of order three we give exact number of such measures.

A Hamiltonian graph $G$ of order $n$ is $k$-ordered, $2\leq k \leq n$, if for every sequence $v_1, v_2, \ldots ,v_k$ of $k$ distinct vertices of $G$, there exists a Hamiltonian cycle that encounters $v_1, v_2, \ldots , v_k$ in this order.…

For a graph $G$ and a positive integer $k$, the $k$-Bell colour graph of $G$ is the graph whose vertices are the partitions of $V$ into at most $k$ independent sets, with two of these being adjacent if there exists a vertex $x$ such that…