Related papers: The enumeration of independent sets on some lattic…
Exact results for the scaling properties of compact polymers on the square lattice are obtained from an effective field theory. The entropic exponent \gamma=117/112 is calculated, and a line of fixed points associated with interacting…
Random tensor models which display multicritical behaviors in a remarkably simple fashion are presented. They come with entropy exponents \gamma = (m-1)/m, similarly to multicritical random branched polymers. Moreover, they are interpreted…
We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…
The self- and mutual-avoiding walk used in conventional lattice models for polymeric systems requires that all lattice sites, polymer segments, and solvent molecules (unoccupied lattice sites) have the same volume. This incorrectly accounts…
We take a critical view at the basic definition of extended single particle states in a non-translationally invariant system. For this, we present the case of a hierarchical lattice and incorporate long range interactions that are also…
The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. We study the number of independent sets $m_{d,b}(n)$ on the generalized Sierpinski…
We consider the entropy of polydisperse chains placed on a lattice. In particular, we study a model for equilibrium polymerization, where the polydispersivity is determined by two activities, for internal and endpoint monomers of a chain.…
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $\R^n$, that generalizes the $n$-th fold DFT of the integer lattice $\Z^n$ to arbitrary lattices. This definition is not applicable for…
We review the properties of reduced density matrices for free fermionic or bosonic many-particle systems in their ground state. Their basic feature is that they have a thermal form and thus lead to a quasi-thermodynamic problem with a…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We study entanglement entropy (EE) for a Maxwell field in 2+1 dimensions. We do numerical calculations in two dimensional lattices. This gives a concrete example of the general results of our recent work on entropy for lattice gauge fields…
The tilings of lozenges in 2 dimensions and of rhomboedra in 3 dimensions are studied when they are constrained by fixed boundary conditions. We establish a link between those conditions and free or periodic boundary ones: the entropy is…
Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are…
An entropy function is proposed in [Phys. Rev. Lett. 131, 251602] as a way to detect criticality even when the system size is small. In this note we apply this strategy in the search for criticality of lattice transfer matrices constructed…
We introduce an exactly solvable lattice model that reveals a universal finite-size scaling law for configurational entropy driven purely by geometry. Using exact enumeration via Burnside's lemma, we compute the entropy for diverse 1D, 2D,…
We study point sets arising from cut-and-project constructions. An important class is weak model sets, which include squarefree numbers and visible lattice points. For such model sets, we give a non-trivial upper bound on their pattern…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…
We create low-entropy states of neutral atoms by utilizing a conceptually new optical-lattice technique that relies on a high-precision, high-bandwidth synthesis of light polarization. Polarization-synthesized optical lattices provide two…