Related papers: Greedy lattice animals: geometry and criticality (…
Three-dimensional $Z(N)$ lattice gauge theories at zero temperature are studied for various values of $N$. Using a modified phenomenological renormalization group, we explore the critical behavior of the generalized $Z(N)$ model for…
We investigate the phase diagram and critical behavior of a three-dimensional lattice CP(N-1) model in the large-N limit. Numerical evidence of first-order transitions is always observed for sufficiently large values of N, i.e. N>2 up to…
The phase structure of three-dimensional Z(N>4) lattice gauge theories at finite temperature is investigated. Using the dual formulation of the models and a cluster algorithm we locate the critical points of the two transitions, determine…
We consider a directed variant of the negative-weight percolation model in a two-dimensional, periodic, square lattice. The problem exhibits edge weights which are taken from a distribution that allows for both positive and negative values.…
Grid entropy is a deterministic quantity inherent to lattice models which captures the entropy of empirical measures along paths that converge weakly to a given target measure. In this paper, we study the limiting behaviour of empirical…
We examine the percolation model in $\mathbb{Z}^d$ by an approach involving lattice animals, in which their relevant characteristic is surface-area-to-volume ratio. Two critical exponents are introduced. The first is related to the growth…
Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\le 0$ is the root of a tree. Vertices labeled by positive integers $n \ge 1$…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…
Diversities are a generalization of metric spaces, where instead of the non-negative function being defined on pairs of points, it is defined on arbitrary finite sets of points. Diversities have a well-developed theory. This includes the…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
We perform numerical simulations of the lattice-animal problem at the upper critical dimension d=8 on hypercubic lattices in order to investigate logarithmic corrections to scaling there. Our stochastic sampling method is based on the…
Given $n$ weighted points (positive or negative) in $d$ dimensions, what is the axis-aligned box which maximizes the total weight of the points it contains? The best known algorithm for this problem is based on a reduction to a related…
LZ-End is a variant of the well-known Lempel-Ziv parsing family such that each phrase of the parsing has a previous occurrence, with the additional constraint that the previous occurrence must end at the end of a previous phrase. LZ-End was…
For a given finite subset P of points of the lattice Z^2, a friendly path is a monotone (uphill or downhill) lattice path which splits points in half; points lying on the path itself are discarded. The purpose of this paper (and its sequel)…
We introduce a spatial stochastic process on the lattice Z^d to model mass extinctions. Each site of the lattice may host a flock of up to N individuals. Each individual may give birth to a new individual at the same site at rate \phi until…
Approaches to finite baryon density lattice QCD usually suffer from uncontrolled systematic uncertainties in addition to the well-known sign problem. We test a method - sign reweighting - that works directly at finite chemical potential and…
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We…
In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet.…