Related papers: Self-avoiding polygons on the square lattice

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

We completely classify the asymptotic behavior of the number of alternating sign matrices classically avoiding a single permutation pattern, in the sense of [Johansson and Linusson 2007]. In particular, we give a uniform proof of an…

We consider a self-avoiding walk model (SAW) on the faces of the square lattice $\mathbb{Z}^2$. This walk can traverse the same face twice, but crosses any edge at most once. The weight of a walk is a product of local weights: each square…

We present a method to estimate the number of irreducible components of the Fermi varieties of periodic Schr\"odinger operators on graphs in terms of suitable asymptotics. Our main theorem is an abstract bound for the number of irreducible…

Correct identification of the Bravais lattice of a crystal is an important step in structure solution. Niggli reduction is a commonly used technique. We investigate the boundary polytopes of the Niggli-reduced cone in the six-dimensional…

The susceptibility amplitude ratio in the neighborhood of a uniaxial Lifshitz point is calculated at one-loop level using field-theoretic and $\epsilon_{L}$-expansion methods. We use the Schwinger parametrization of the propagator in order…

Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

A remarkable theoretical prediction for a crystalline (polymerized) surface is that its Poisson ratio (\sigma) is negative. Using a large scale Monte Carlo simulation of a simple model of such surfaces we show that this is indeed true. The…

We investigate polymers pulled away from an interacting surface, where the force is applied to the untethered endpoint and at an angle $\theta$ to the surface. We use the canonical self-avoiding walk model of polymers and obtain the phase…

We study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\subseteq [n]$ of vertices the independent set oracle answers whether…

The matroid intersection problem is a fundamental problem that has been extensively studied for half a century. In the classic version of this problem, we are given two matroids $\mathcal{M}_1 = (V, \mathcal{I}_1)$ and $\mathcal{M}_2 = (V,…

Let $N$ be an odd and squarefree positive integer divisible by at least two relative prime integers bigger or equal than 4. Our main theorem is an asymptotic formula solely in terms of $N$ for the stable arithmetic self-intersection number…

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees were much larger, e.g., 248832 (for just the non-degenerate roots)…

An upper bound on the error probability of specific lattices, based on their distance-spectrum, is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers.…

Let $f_1,\dots,f_m$ be polynomials in $n$ variables with coefficients in a finite field $\mathbb{F}_q$. We estimate the number of points $\underline{x}$ in $\mathbb{F}_q^n$ such that each value $f_i(\underline{x})$ is a nonzero square in…

We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…

We present an analysis of extensive large-scale Monte Carlo simulations of self-avoiding fixed-connectivity membranes for sizes (number of faces) ranging from 512 to 17672 (triangular) plaquettes. Self-avoidance is implemented via…

Rudin conjectured that there are never more than c N^(1/2) squares in an arithmetic progression of length N. Motivated by this surprisingly difficult problem we formulate more than twenty conjectures in harmonic analysis, analytic number…

We study multivariate numerical integration of smooth functions in weighted Sobolev spaces with dominating mixed smoothness $\alpha\geq 2$ defined over the $s$-dimensional unit cube. We propose a new quasi-Monte Carlo (QMC)-based quadrature…