Related papers: Bounds on the lattice point enumerator via slices …

Several years ago the authors started looking at some problems of convex geometry from a more general point of view, replacing volume by an arbitrary measure. This approach led to new general properties of the Radon transform on convex…

Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

Analogues of the classical inequalities from the Brunn-Minkowski theory for rotation intertwining additive maps of convex bodies are developed. Analogues are also proved of inequalities from the dual Brunn-Minkowski theory for intertwining…

We introduce several new notions of (sectional) curvature bounds for Lorentzian pre-length spaces: On the one hand, we provide convexity/concavity conditions for the (modified) time separation function, and, on the other hand, we study…

It is well known that the orbit of a lattice in hyperbolic $n$-space is uniformly distributed when projected radially onto the unit sphere. In the present work, we consider the fine-scale statistics of the projected lattice points, and…

We prove several inequalities estimating the distance between volumes of two bodies in terms of the maximal or minimal difference between areas of sections or projections of these bodies. We also provide extensions in which volume is…

This is a survey article on the theory of lattice points in large planar domains and bodies of dimensions 3 and higher, with an emphasis on recent developments and new methods, including a lot of results established only during the last few…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…

We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…

Generalized entropic projections and dominating points are solutions to convex minimization problems related to conditional laws of large numbers. They appear in many areas of applied mathematics such as statistical physics, information…

We study the volume ratio between projections of two convex bodies. Given a high-dimensional convex body $K$ we show that there is another convex body $L$ such that the volume ratio between any two projections of fixed rank of the bodies…

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

In this note, we estimate the upper bound of volume of closed positively or nonnegatively curved Alexandrov space $X$ with strictly convex boundary. We also discuss the equality case. In particular, the Boundary Conjecture holds when the…

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…