Related papers: Counting lattice points and o-minimal structures

In this paper we show how to use elementary methods to prove that the volume of Sl_k R / Sl_k Z is zeta(2) * zeta(3) * ... * zeta(k) / k. Using a version of reduction theory presented in this paper, we can compute the volumes of certain…

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower…

We consider random lattices taken from the general symplectic ensemble and count the number of lattice points of a typical lattice in nested families $B_t$ of certain Borel sets. Our main result is that for almost every general symplectic…

The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…

Let $\delta_0(P,k)$ denote the degree $k$ dilation of a point set $P$ in the domain of plane geometric spanners. If $\Lambda$ is the infinite square lattice, it is shown that $1+\sqrt{2} \leq \delta_0(\Lambda,3) \leq (3+2\sqrt2) \, 5^{-1/2}…

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…

We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…

We study the smallest convex lattice generated by a finite set of points. To analyze this structure, we introduce the notion of a point configuration, defined via the relative lattice. Under a suitable completeness condition, this lattice…

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…

Let $\Omega \subset \mathbb{R}^n$ be a convex polytope ($n \leq 3$). The Ritz projection is the best approximation, in the $W^{1,2}_0$-norm, to a given function in a finite element space. When such finite element spaces are constructed on…

We contribute a new algebraic method for computing the orthogonal projections of a point onto a rational algebraic surface embedded in the three dimensional projective space. This problem is first turned into the computation of the finite…

We prove the following restricted projection theorem. Let $n\ge 3$ and $\Sigma \subset S^{n}$ be an $(n-1)$-dimensional $C^2$ manifold such that $\Sigma$ has sectional curvature $>1$. Let $Z \subset \mathbb{R}^{n+1}$ be analytic and let $0…

We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex…

A classic theorem of Kazhdan and Margulis states that for any semisimple Lie group without compact factors, there is a positive lower bound on the covolume of lattices. H. C. Wang's subsequent quantitative analysis showed that the…

We prove the higher dimensional case of the o-minimal variant of Zilber's Restricted Trichotomy Conjecture. More precisely, let $\mathcal R$ be an o-minimal expansion of a real closed field, let $M$ be an interpretable set in $\mathcal R$,…

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…

A note connecting arguments scattered in the extant literature proving that, in any o-minimal expansion of the real field, a definable family of sets has the property that the set of parameters corresponding to finite-volume fibers is…

The O(n) non-linear $\sigma$-model is simulated on 2-dimensional regular and random lattices. We use two different levels of randomness in the construction of the random lattices and give a detailed explanation of the geometry of such…

For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…

Lattices are discrete mathematical objects with widespread applications to integer programs as well as modern cryptography. A fundamental problem in both domains is the Closest Vector Problem (popularly known as CVP). It is well-known that…