Related papers: Nonconventional averages along arithmetic progress…
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
We introduce and analyze a natural class of nonlinear dynamics for spin systems such as the Ising model. This class of dynamics is based on the framework of mass action kinetics, which models the evolution of systems of entities under…
In many practical applications the underlying graph must be as equitable colored as possible. A coloring is called equitable if the number of vertices colored with each color differs by at most one, and the least number of colors for which…
We give two extensions of the recent theorem of the first author that the odd distance graph has unbounded chromatic number. The first is that for any non-constant polynomial $f$ with integer coefficients and positive leading coefficient,…
We approximate a 2D Ising spin glass by tiling an infinite square lattice with large identical unit cells. The interactions within the unit cell are random. Each such sample shows one or more critical points. We examine the scaling of the…
An edge-coloring of a graph $G$ with colors $1,2,\ldots,t$ is called an interval $t$-coloring if for each $i\in \{1,2,\ldots,t\}$ there is at least one edge of $G$ colored by $i$, and the colors of edges incident to any vertex of $G$ are…
We propose a solution to the puzzle of dimensional reduction in the random field Ising model, inverting the question and asking: to what random problem in $D=d+2$ dimensions does a pure system in $d$ dimensions correspond? We consider two…
We consider probability measures arising from the Cauchy summation identity for the LLT (Lascoux--Leclerc--Thibon) symmetric polynomials of rank $n \geq 1$. We study the asymptotic behaviour of these measures as one of the two sets of…
We consider $N$ two-dimensional Ising models coupled in presence of quenched disorder and use scale invariant scattering theory to exactly show the presence of a line of renormalization group fixed points for any fixed value of $N$ other…
We study an Ising spin system coupled to a fluctuating four-dimensional $Z_2$-Regge lattice and compare with the results of the four-dimensional Ising model on a regular lattice. Particular emphasis is placed on the phase transition of the…
For a finite random graph, we defined a simple model of statistical mechanics. We obtain an annealed asymptotic result for the random partition function for this model on finite random graphs as n; the size of the graph is very large. To…
The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge…
We construct for every integer $k\geq 3$ and every real $\mu\in(0, \frac{k-1}{k})$ a set of integers $X=X(k, \mu)$ which, when coloured with finitely many colours, contains a monochromatic $k$-term arithmetic progression, whilst every…
The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set…
We study a coarsening process of one-dimensional cell complexes. We show that if cell boundaries move with velocities proportional to the difference in size of neighboring cells, then the average cell size grows at a prescribed exponential…
Motzkin spin-chains, which include 'colorless' (integer spin $s=1$) and 'colorful' ($s \geq 2$) variants, are one-dimensional (1D) local integer spin models notable for their lack of a conformal field theory (CFT) description of their…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
We establish new algorithmic guarantees with matching hardness results for coloring and independent set problems in one-sided expanders and related classes of graphs. For example, given a $3$-colorable regular one-sided expander, we compute…
We study the infinite graph of $n$-dimensional rectangular grid that doesn't appear distance regular and the distance regular colorings of this graph, which are defined as the distance colorings with respect to completely regular codes. It…