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

Let $G$ be a graph on $n\geq 3$ vertices, claw the bipartite graph $K_{1,3}$, and $Z_i$ the graph obtained from a triangle by attaching a path of length $i$ to its one vertex. $G$ is called 1-heavy if at least one end vertex of each induced…

An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP…

We consider models with nearest-neighbor interactions and with the set $[0,1]$ of spin values, on a Cayley tree of order $k\geq 1$. It is known that the "splitting Gibbs measures" of the model can be described by solutions of a nonlinear…

We consider a single particle tunnelling in a tight-binding model with nearest-neighbour couplings, in the presence of a periodic high-frequency force. An effective Hamiltonian for the particle is derived using an averaging method…

Interesting quantum integrable models are rare and one often has to resort to approximation methods. One of these is the Raleigh Ritz method which under certain circumstances allows to approximately compute the lowest energy eigenstate (or…

This paper concerns the explicit construction of extremal Kaehler metrics on total spaces of projective bundles, which have been studied in many places. We present a unified approach, motivated by the theory of hamiltonian 2-forms (as…

Topological color codes are among the stabilizer codes with remarkable properties from quantum information perspective. In this paper we construct a four-valent lattice, the so called ruby lattice, governed by a 2-body Hamiltonian. In a…

For any undirected and simple graph G = (V;E), where V denotes the vertex set and E the edge set of G. G is called hamiltonian if it contains a cycle that visits each vertex of G exactly once. Ore (1960) proved that G is hamiltonian if…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Graphs and recently hypergraphs have been known as an important tool for considering different properties of quantum many-body systems. In this paper, we study a mapping between an important class of quantum systems namely quantum…

Let claw be the graph $K_{1,3}$. A graph $G$ on $n\geq 3$ vertices is called \emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$, and 1-heavy if at least one end-vertex of each induced claw of…

We provide a complete characterization of those graphons $W$ for which the inhomogeneous random graph $G(n,W)$ is asymptotically almost surely Hamiltonian. The characterization involves three conditions. Two of them constitute the…

A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…

We introduce the concept of tetris chains, which are linear arrays of 4-site molecules that differ by their intermolecular hopping geometry. We investigate the fermionic symmetry-protected topological Haldane phase in these systems using…

In this paper, we consider the Ising-Vanniminus model on an arbitrary order Cayley tree. We generalize the results conjectured in [Chinese Journal of Physics, 54 (4), 635-649 (2016)] and [International Journal of Modern Physics,…

More than 40 years ago Chv\'atal introduced a new graph invariant, which he called graph toughness. From then on a lot of research has been conducted, mainly related to the relationship between toughness conditions and the existence of…

In the framework of the so-called quasi-Hermitian quantum mechanics of stationary unitary systems, bound states are usually constructed as eigenstates $|\psi_n \rangle$ of a Hamiltonian operator $H$ with real spectrum which is…

We study the computational complexity of Feedback Vertex Set on subclasses of Hamiltonian graphs. In particular, we consider Hamiltonian graphs that are regular or are planar and regular. Moreover, we study the less known class of…

We realize O'Grady's six dimensional example of irreducible holomorphic symplectic manifold as a quotient of an IHS manifold of K3$^{[3]}$-type by a birational involution, thereby computing its Hodge numbers.

We define and study a long-range version of the XX model, arising as the free-fermion point of the XXZ-type Haldane--Shastry (HS) chain. It has a description via non-unitary fermions, based on the free-fermion Temperley--Lieb algebra, and…