Related papers: Greedy lattice animals: geometry and criticality (…

The standard U(N) and SU(N) integrals are calculated in the large N limit. Our main finding is that for an important class of integrals this limit is different for two groups. We describe the critical behaviour of SU(N) models and discuss…

We introduce and study a novel tensor approach for fast and accurate assembled summation of a large number of lattice-allocated potentials represented on 3D $N\times N \times N$ grid with the computational requirements only \emph{weakly…

We study the degree of success of a single predator hunting a herd of prey on a two dimensional square lattice landscape. We explicitly consider the self volume of the prey restraining their dynamics on the lattice. The movement of both…

We present a detailed Monte Carlo study of the high-temperature phase of the two-dimensional driven lattice gas at infinite driving field. We define a finite-volume correlation length, study its finite-size-scaling behavior and extrapolate…

Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…

A new complexity measure named as Lattice Complexity is presented for finite symbolic sequences. This measure is based on the symbolic dynamics of one-dimensional iterative maps and Lempel-Ziv Complexity. To make Lattice Complexity…

Cages ($r$-regular graphs of girth $g$ and minimum order) and their variants have been studied for over seventy years. Here we propose a new variant, "weighted cages". We characterize their existence; for cases $g=3,4$ we determine their…

We generalize a sampling algorithm for lattice animals (connected clusters on a regular lattice) to a Monte Carlo algorithm for `graph animals', i.e. connected subgraphs in arbitrary networks. As with the algorithm in [N. Kashtan et al.,…

A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it…

The sums and maxima of weighted non-stationary random length sequences of regularly varying random variables may have the same tail and extremal indices, Markovich and Rodionov (2020). The main constraints are that there exists a unique…

The model of competition between densities of two different species, called predator and prey, is studied on a one dimensional periodic lattice, where each site can be in one of the four states say, empty, or occupied by a single predator,…

We survey the critical behaviour of strongly interacting matter, as determined in finite temperature lattice QCD.

We review recent progress in lattice QCD at finite density. The phase diagram of QCD and the equation of state at finite temperature and density are discussed. In particular, we focus on the critical point terminating a first order phase…

We consider the limiting fluctuations of the geodesic in the directed landscape, conditioning on its length going to infinity. It was shown in \cite{Liu22b,Ganguly-Hegde-Zhang23} that when the directed landscape $\mathcal{L}(0,0;0,1) = L$…

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…

Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common…

Let $K \subseteq \mathbb{R}^d$ be a convex body and let $\mathbf{w} \in \operatorname{int}(K)$ be an interior point of $K$. The coefficient of asymmetry $\operatorname{ca}(K,\mathbf{w}) := \min\{ \lambda \geq 1 : \mathbf{w} - K \subseteq…

An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\Psi(G)$. In this paper, an algorithm to count…

We pursue the idea of adding the naive $\mu N$ term, where $\mu$ is the quark chemical potential and $N$ is the conserved quark number, to the lattice QCD action. While computations of higher order susceptibilities, required for estimating…

We study the phase structure of QCD at finite temperature and density by numerical simulations on a lattice. The most important point for the numerical study at finite density is treatment of the sign problem. We propose a method to avoid…