Related papers: Lattice points close to a helix
We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…
We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…
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.
Based on a fairly precise approximation to the lattice discrepancy of a Lame disc, an asymptotic formula is established for the number of lattice points in a related three-dimensional body, linearly dilated by a large real parameter x.…
This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…
We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…
We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…
We find sharp absolute constants $C_1$ and $C_2$ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval…
Experimental designs that spread out points apart from each other on projections are important for computer experiments when not necessarily all factors have substantial influence on the response. We provide a theoretical framework to…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
In this paper, we continue the study of three close factorizations of an integer and correct a mistake of a previous result. This turns out to be related to lattice points close to the center point $(\sqrt{N}, \sqrt{N})$ of the hyperbola $x…
We propose a new method to construct maximin distance designs with arbitrary number of dimensions and points. The proposed designs hold interleaved-layer structures and are by far the best maximin distance designs in four or more…
Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant…
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…
We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…
We answer a question of Vorobets by showing that the lattice property for flat surfaces is equivalent to the existence of a positive lower bound for the areas of affine triangles. We show that the set of affine equivalence classes of…
We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…