Related papers: Covering lattice points by subspaces
The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…
In 1978, Makai Jr. established a remarkable connection between the volume-product of a convex body, its maximal lattice packing density and the minimal density of a lattice arrangement of its polar body intersecting every affine hyperplane.…
We study the geometry of convex lattice $n$-gons with $n$ boundary lattice points and $k\geq 3$ collinear interior lattice points. We describe a process to construct a primitive lattice triangle from an edge of a convex lattice $n$-gon,…
One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…
We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
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…
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 classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…
In this paper, extending the work of Gal'perin (Comm. Math. Phys. 154: 63-84, 1993), we investigate generalizations of the concepts of centroids and static equilibrium points of a convex body in spherical, hyperbolic and normed spaces. In…
Consider an arrangement of $n$ congruent zones on the $d$-dimensional unit sphere $S^{d-1}$, where a zone is the intersection of an origin symmetric Euclidean plank with $S^{d-1}$. We prove that, for sufficiently large $n$, it is possible…
We prove that in any dimension $n$ there exists an origin-symmetric ellipsoid ${\mathcal{E}} \subset {\mathbb{R}}^n$ of volume $ c n^2 $ that contains no points of ${\mathbb{Z}}^n$ other than the origin, where $c > 0$ is a universal…
In this paper, the isodiametric problem for centrally symmetric convex bodies in the Euclidean d-space R^d containing no interior non-zero point of a lattice L is studied. It is shown that the intersection of a suitable ball with the…
We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…
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.
The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…
We show how 3-dimensional, N=2 supersymmetric theories, including super QCD with matter fields, can be put on the lattice with existing techniques, in a way which will recover supersymmetry in the small lattice spacing limit. Residual…
We give short and simple proofs of what seem to be folklore results: * the maximum cardinality of the intersection of a lattice cube with an affine subspace; * the minimum number of affine subspaces needed to cover a lattice cube.
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…