Related papers: Lattice point inequalities for centered convex bod…

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…

In this note, we study possible extensions of the Central Limit Theorem for non-convex bodies. First, we prove a Berry-Esseen type theorem for a certain class of unconditional bodies that are not necessarily convex. Then, we consider a…

For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…

Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…

We extend the definition of the centroid body operator to an Orlicz--Lorentz centroid body operator on the star bodies in $\mathbb R^n$, and establish the sharp affine isoperimetric inequality that bounds (from below) the volume of 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 present a short proof of Klartag's central limit theorem for convex bodies, using only the most classical facts about log-concave functions. An appendix is included where we give the proof that thin shell implies CLT. The paper is…

In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.

We prove that the length of the projection of the vector joining the centers of mass of a convex body on the plane and of its boundary to an arbitrary direction does not exceed $\frac{1}{6}$ of the body width in this direction. It follows…

Among integral polytopes (vertices with integral coordinates), lattice-free polytopes - intersecting the lattice ONLY at their vertices- are of particular interestin combinatorics and geometry of numbers. A natural question is to measure…

For a minimal inequality derived from a maximal lattice-free simplicial polytope in $\R^n$, we investigate the region where minimal liftings are uniquely defined, and we characterize when this region covers $\R^n$. We then use this…

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

Heinz Huber (1956) considered the following problem on the the hyperbolic plane H. Consider a strictly hyperbolic subgroup of automorphisms on H with compact quotient, and choose a conjugacy class in this group. Count the number of vertices…

In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…

We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…

Let $\# K$ be a number of integer lattice points contained in a set $K$. In this paper we prove that for each $d\in {\mathbb N}$ there exists a constant $C(d)$ depending on $d$ only, such that for any origin-symmetric convex body $K \subset…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

Motivated by the problem of bounding the number of rays of plane tropical curves we study the following question: Given $n\in\mathbb{N}$ and a unimodular $2$-simplex $\Delta$ what is the maximal number of vertices a lattice polytope…

We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice…

We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…