Related papers: Covering lattice points by subspaces

We state a general formula to compute the volume of the intersection of the regular $n$-simplex with some $k$-dimensional subspace. It is known that for central hyperplanes the one through the centroid containing $n-1$ vertices gives the…

We show that the polyhedron defined as the convex hull of the lattice points above the hyperbola $\left\{xy = n\right\}$ has between $\Omega(n^{1/3})$ and $O(n^{1/3} \log n)$ vertices. The same bounds apply to any hyperbola with rational…

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

The paper investigates uniformly closed subspaces, sublattices, and ideals of finite codimension in Archimedean vector lattices. It is shown that every uniformly closed subspace (or sublattice) of finite codimension may be written as an…

In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…

Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

We prove several estimates for the moments of arbitrary measures on convex bodies. We apply these estimates to show a new slicing inequality for measures on convex bodies. We also deduce estimates for the outer volume ratio distance from an…

We introduce and study the notion of orthosymmetric spaces over an Archimedean vector lattice as a generalization of finite-dimentional Euclidean inner spaces. A special attention has been paid to linear operators on these spaces.

In the first part of this paper, we obtain symmetric formulae for the probabilities that a plane convex body hits exactly 1, 2, 3, 4, 5 or 6 triangles of a lattice of congruent triangles in the plane. Furthermore, a very simple formula for…

To any $k$-dimensional subspace of $\mathbb Q^n$ one can naturally associate a point in the Grassmannian ${\rm Gr}_{n,k}(\mathbb R)$ and two shapes of lattices of rank $k$ and $n-k$ respectively. These lattices originate by intersecting the…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

For a convex body B in three-dimensional Euclidean space, which is invariant under rotations around one coordinate axis and has a smooth boundary of bounded nonzero curvature, the lattice point discrepancy (number of integer points minus…

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

We provide an elementary proof of a formula for the number of northeast lattice paths that lie in a certain region of the plane. Equivalently, this formula counts the lattice points inside the Pitman--Stanley polytope of an n-tuple.

Given N points in the plane $P_1 P_2...P_N$ and a location $\Omega$, the union of discs with diameters $[\Omega P_i], i = 1, 2,...N$ covers the convex hull of the points. The location $\Omega_s$ minimizing the area covered by the union of…

We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…

Suppose we put an $\epsilon$-disk around each lattice point in the plane, and then we rotate this object around the origin for a set $\Theta$ of angles. When do we cover the whole plane, except for a neighborhood of the origin? This is the…