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

Generalizations of QCD in which the number of colors N is taken to infinity are characterized by profound mathematical properties, with far-reaching implications for fundamental problems and for phenomenological issues alike. In this…

We study numerically three-dimensional Z(N) lattice gauge theories at finite temperature, for N = 5, 6, 8, 12, 13 and 20 on lattices with temporal extension $N_t$ = 2, 4, 8. For each model, we locate phase transition points and determine…

We study two continuous and isotropic analogues of the model of greedy lattice animals introduced by Cox, Gandolfi, Griffin and Kesten in 1993. In our framework, animals collect masses scattered on a Poisson point process on $\mathbb R^d$,…

We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the…

A class of countable infinite graphs with unbounded vertex degree is considered. In these graphs, the vertices of large degree `repel' each other, which means that the path distance between two such vertices cannot be smaller than a certain…

We study the statistics of column-convex lattice animals generated by the stacking of squares on a staircase with step height p. We calculate the number of animals with area k living on l stairs. The total number of animals with area k is…

All approaches currently used to study finite baryon density lattice QCD suffer from uncontrolled systematic uncertainties in addition to the well-known sign problem. We formulate and test an algorithm, sign reweighting, that works directly…

A connected set in a graph is a non-empty set of vertices that induces a connected subgraph. In an infinite lattice, a connected set is often referred to as a lattice animal, whose enumeration up to isomorphism is a classical problem in…

The saddle point equation described by the eigenvalues of N by N Hermitian matrices is analized for a finite N case and the scaling relation for the large N is considered. The critical point and the critical exponents of matrix model are…

The distribution of the first positive position reached by a random walker starting at the origin is central to the analysis of extremes and records in one-dimensional random walks. In this work, we present a detailed and self-contained…

Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N the sum of weights of the edges in N\M is at most the sum of weights of the edges in M\N. We prove that if w…

We study the smallest, as well as the largest numbers of congruences of lattices of an arbitrary finite cardinality $n$. Continuing the work of Freese and Cz\' edli, we prove that the third, fourth and fifth largest numbers of congruences…

We present model predictions for the spectrum of $CP^{N-1}$ in a periodic box and use them to interpret the strong finite size effects observed in lattice simulations at medium values of $N$. The asymptotic scaling behaviour of alternative…

This article introduces a new, simple solvable lattice for directed animals: the directed king's lattice, or square lattice with next nearest neighbor bonds and preferred directions {W, NW, N, NE, E}. We show that the directed animals in…

We consider a vertex reinforced random walk on the integer lattice with sub-linear reinforcement. Under some assumptions on the regular variation of the weight function, we characterize whether the walk gets stuck on a finite interval. When…

A point process on the topological space S is at most countable subset without a random accumulation point in S. In studies of the point processes, there is a problem of seeing the properties of rigidity and tolerance, and this problem is…

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…

For a positive integer $n$, let $[n]$ denote $\{1, \ldots, n\}$. For a 2-dimensional integer lattice point $\mathbf{b}$ and positive integers $k\geq 2$ and $n$, a \textit{$k$-sum $\mathbf{b}$-free set} of $[n]\times [n]$ is a subset $S$ of…

Consider a subset [1,2,...,n]x[1,2,...,n] of the plane integer lattice. Take any non self-intersecting n^2-gon built on it (straight angles are allowed). The square of a side length is a positive integer. It is thus natural to ask how large…

We consider spread-out models of lattice trees and lattice animals on $\mathbb Z^d$, for $d$ above the upper critical dimension $d_{\mathrm c}=8$. We define a correlation length and prove that it diverges as $(p_c-p)^{-1/4}$ at the critical…