Related papers: Sharp o-minimality and lattice point counting

We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…

We derive the exact critical line of the O($n$) loop model on the martini lattice as a function of the loop weight $n$.A finite-size scaling analysis based on transfer matrix calculations is also performed.The numerical results coincide…

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…

We give a sharp upper bound on the multiplicity of a fake weighted projective space with at worst canonical singularities. This is equivalent to giving a sharp upper bound on the index of the sublattice generated by the vertices of a…

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

Approximate lattices of Euclidean spaces, also known as Meyer sets, are aperiodic subsets with fascinating properties. In general, approximate lattices are defined as approximate subgroups of locally compact groups that are discrete and…

We study and simulate N=2 supersymmetric Wess-Zumino models in one and two dimensions. For any choice of the lattice derivative, the theories can be made manifestly supersymmetric by adding appropriate improvement terms corresponding to…

Motivated by a 2019 result of Faulhuber-Steinerberger, we demonstrate that the real square lattice $\mathbb{Z}^2$ exhibits the same local, extremal property as the hexagonal lattice $\Lambda$, where distances of lattice points from the…

Let $G$ be a unipotent group and $\mathcal F=\{F_t:t\in (0,\infty)\}$ a family of subsets of $G$, with $\mathcal F$ definable in an o-minimal expansion of the real field. Given a lattice $\Gamma\subseteq G$, we study the possible Hausdorff…

We define parafermionic observables in various lattice loop models, including examples where no Kramers-Wannier duality holds. For a particular rhombic embedding of the lattice in the plane and a value of the parafermionic spin these…

The theory of the tight span, a cell complex that can be associated to every metric $D$, offers a unifying view on existing approaches for analyzing distance data, in particular for decomposing a metric $D$ into a sum of simpler metrics as…

We study the lattice N=1 Wess-Zumino model in two dimensions and we construct a sequence $\rho^{(L)}$ of exact lower bounds on its ground state energy density $\rho$, converging to $\rho$ in the limit $L\to\infty$. The bounds $\rho^{(L)}$…

We review the construction of exactly solvable lattice models whose continuum limits are $N=2$ supersymmetric models. Both critical and off-critical models are discussed. The approach we take is to first find lattice models with natural…

We present a new family of sharp examples for the Szemer\'edi-Trotter theorem. These are the first examples not based on a rectangular lattice. We also include an application to the discrete inverse Loomis-Whitney problem.

This paper initiates the systematic study of the number of points of bounded height on symmetric squares of weak Fano varieties. We provide a general framework for establishing the point count on $\text{Sym}^2 X$. In the specific case of…

We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…

Branched polymers can be classified into two categories that obey the different formulae: \begin{equation} \nu= \begin{cases} \hspace{1mm}\displaystyle\frac{2(1+\nu_{0})}{d+2} & \hspace{3mm}\mbox{for polymers…

We prove sharp upper bounds on the volume and the number of lattice points on edges of higher-dimensional reflexive simplices. These convex-geometric results are derived from new number-theoretic bounds on the denominators of unit fractions…

We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of several hitherto unknown families of simplices in quaternionic…

Let $\vec{G}=(V,E^+\cup E^-)$ be a bidirected graph whose underlying undirected graph $G=(V,E)$ is $2$-edge-connected. A strongly connected orientation (SCO) is defined as a subset of arcs that contains exactly one of $e^+,e^-$ for every…