相关论文: A Contour Method on Cayley tree

Combinatorial gauge symmetry is a principle that allows us to construct lattice gauge theories with two key and distinguishing properties: a) only one- and two-body interactions are needed; and b) the symmetry is exact rather than emergent…

We consider fertile three-state Hard-Core (HC) models with the activity parameter $\lambda>0$ on a Cayley tree. It is known that there exist four types of such models: "wrench"\,, "wand"\,, "hinge"\, and "pipe"\,. In cases "wand"\, and…

Pure gauge theories are rather different from theories with pure scalar and fermionic matter, especially in terms of the nature of excitations. For example, in scalar and fermionic theories, one can create ultra-local excitations. For a…

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…

This paper describes the use of simple lattice models for studying the properties of structurally disordered systems like glasses and granulates. The models considered have crystalline states as ground states, finite connectivity, and are…

Splitting trees are those random trees where individuals give birth at constant rate during a lifetime with general distribution, to i.i.d. copies of themselves. The width process of a splitting tree is then a binary, homogeneous…

We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…

Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…

In this paper we consider a $p$-adic Ising model on the Cayley tree of order $k\geq 2$. We give full description of all $p$-adic translation-invariant generalized Gibbs measures for $k=3$. Moreover, we show the existence of phase transition…

For a large class of finite-range quantum spin models with half-integer spins, we prove that uniqueness of the ground state implies the existence of a low-lying excited state. For systems of linear size L, of arbitrary finite dimension, we…

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…

Chaotic dependence on temperature refers to the phenomenon of divergence of Gibbs measures as the temperature approaches a certain value. Models with chaotic behaviour near zero temperature have multiple ground states, none of which are…

We study Gibbsian models of unbounded integer-valued spins on trees which possess a symmetry under height-shift. We develop a theory relating boundary laws to gradient Gibbs measures, which applies also in cases where the corresponding…

The hard-core model has attracted much attention across several disciplines, representing lattice gases in statistical physics and independent sets in discrete mathematics and computer science. On finite graphs, we are given a parameter…

We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…

We give a short proof of the fact that the number of labelled trees on $n$ vertices is $n^{n-2}$. Although many short proofs are known, we have not seen this one before.

We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled…

We study gradient models for spins taking values in the integers (or an integer lattice), which interact via a general potential depending only on the differences of the spin values at neighboring sites, located on a regular tree with d + 1…

We characterize the spectrum of the transition matrix for simple random walk on graphs consisting of a finite graph with a finite number of infinite Cayley trees attached. We show that there is a continuous spectrum identical to that for a…

We exhibit a remarkable equivalence between the dynamics of an intermittent nonlinear map and the electronic transport properties (obtained via the scattering matrix) of a crystal defined on a double Cayley tree. This strict analogy reveals…