Related papers: Sharp o-minimality and lattice point counting
We show how to construct lattice sigma models in one, two and four dimensions which exhibit an exact fermionic symmetry. These models are discretized and {\it twisted} versions of conventional supersymmetric sigma models with N=2…
We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
We formulate chiral gauge theories non-perturbatively, using two different cuttoffs for the fermions and gauge bosons. We use a lattice with spacing $b$ to regulate the gauge fields in standard fashion, while computing the chiral fermion…
We establish an error estimate for counting lattice points in Euclidean norm balls (associated to an arbitrary irreducible linear representation) for lattices in simple Lie groups of real rank at least two. Our approach utilizes refined…
Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular…
We discuss the possibility of representing supersymmetry exactly in a lattice discretized system. In particular, we construct a perfect supersymmetric action for the Wess-Zumino model.
The Pila-Wilkie theorem states that if a set $X\subseteq \mathbb R^n$ is definable in an o-minimal structure $\mathcal R$ and contains `many' rational points, then it contains an infinite semialgebraic set. In this paper, we extend this…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
An argument of A.Borel shows that every compact connected Lie group is homeomorphic to the Cartesian product of its derived subgroup and a torus. We prove a parallel result for definably compact definably connected groups definable in an…
We consider expansions of o-minimal structures on the real field by collections of restrictions to the positive real line of the canonical Weierstrass products associated to sequences such as $(-n^s)_{n>0}$ (for $s>0$) and $(-s^n)_{n>0}$…
In this paper, we investigate the H\"ormander type theorems for the multi-linear and multi-parameter Fourier multipliers. When the multipliers are characterized by $L^u$-based Sobolev norms for $1<u\le 2$ , our results on the smoothness…
The eigenvalue spectrum $\rho(\lambda)$ of the Dirac operator is numerically calculated in lattice QCD with 2+1 flavors of dynamical domain-wall fermions. In the high-energy regime, the discretization effects become significant. We subtract…
We show that a family of extremely thin sets satisfy the Erd\H{o}s similarity conjecture. These examples lie outside the range covered by recent work of Shmerkin and Yavicoli \cite{ShmerkinYavicoli2025}. As we shall see, they have small…
We study different extended formulations for the set $X = \{x\in\mathbb{Z}^n \mid Ax = Ax^0\}$ in order to tackle the feasibility problem for the set $X_+=X \cap \mathbb{Z}^n_+$. Here the goal is not to find an improved polyhedral…
The lattice $A_n^*$ is an important lattice because of its covering properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an algorithm to compute the nearest lattice point in $A_n^*$ that requires $O(n\log{n})$…
In this paper, we study additive properties of finite sets of lattice points on spheres in $3$ and $4$ dimensions. Thus, given $d,m \in \mathbb{N}$, let $A$ be a set of lattice points $(x_1, \dots, x_d) \in \mathbb{Z}^d$ satisfying $x_1^2 +…
We consider the lattice point problem corresponding to a family of elliptic paraboloids in $\mathbb{R}^d$ with $d\ge3$ and we prove the expected to be optimal exponent, improving previous results. This is especially noticeable for $d=3$…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…