Related papers: Lattice-point enumerators of ellipsoids

A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…

We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

We prove a higher-rank analogue of a well-known result of W. M. Schmidt concerning almost everywhere pointwise discrepancy bounds for lattices in Euclidean space (see Theorem 1 [Trans. Amer. Math. Soc. 95 (1960), 516-529]). We also…

The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…

In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…

Suppose $\Omega\subseteq\RR^d$ is a bounded and measurable set and $\Lambda \subseteq \RR^d$ is a lattice. Suppose also that $\Omega$ tiles multiply, at level $k$, when translated at the locations $\Lambda$. This means that the…

We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…

For a real $N\ge 1$ and a vector $\xi =(1,\xi_1,...,\xi_n)$ define a matrix $$ {\cal A} (\xi, N) = ({array}{ccccc} N^{-1} & 0& 0& ... &0 \cr N^{\frac{1}{n}} \xi_1 & -N^{\frac{1}{n}} & 0&... & 0 \cr N^{\frac{1}{n}} \xi_2 &0& -N^{\frac{1}{n}}…

We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly…

Motivated by conjectures of Mahler and Makai Jr., we study bounds on the volume of a convex body in terms of the successive minima of its polar body.

Magnitude is a numerical invariant of compact metric spaces, originally inspired by category theory and now known to be related to myriad other geometric quantities. Generalizing earlier results in $\ell_1^n$ and Euclidean space, we prove…

This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…

Let $\Lb$ be a lattice in an $n$-dimensional Euclidean space $E$ and let $\Lb'$ be a Minkowskian sublattice of $\Lb$, that is, a sublattice having a basis made of representatives for the Minkowski successive minima of $\Lb$. We consider the…

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 study the Minkowski length L(P) of a lattice polytope P, which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P. The Minkowski length represents the largest possible number of factors in…

Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…

We give a new proof of the Minkowski-Hlawka bound on the existence of dense lattices. The proof is based on an elementary method for constructing dense lattices which is almost effective.

A generalization of pairwise intersecting Minkowski arrangement of centrally symmetric convex bodies is the pairwise intersecting Minkowski arrangement of order $\mu$. Here, the homothetic copies of a centrally symmetric convex body are so…

We deduce explicit formulae for the intrinsic volumes of an ellipsoid in $\mathbb R^d$, $d\ge 2$, in terms of elliptic integrals. Namely, for an ellipsoid ${\mathcal E}\subset \mathbb R^d$ with semiaxes $a_1,\ldots, a_d$ we show that…