Related papers: Lattice points close to a helix
A lattice $(d,k)$-polytope is the convex hull of a set of points in $\mathbb{R}^d$ whose coordinates are integers ranging between $0$ and $k$. We consider the smallest possible distance $\varepsilon(d,k)$ between two disjoint lattice…
Let B denote a three-dimensional body of rotation, with respect to one coordinate axis, whose boundary is sufficiently smooth and of bounded nonzero Gaussian curvature throughout, except for the two boundary points on the axis of rotation,…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
Suppose $X$ is a locally solid lattice ring. It is known that there are three classes of bounded group homomorphisms on $X$ whose topological structures make them again topological rings. In this note, we consider lattice structure on them;…
This paper concerns the number of lattice points in the plane which are visible along certain curves to all elements in some set S of lattice points simultaneously. By proposing the concept of level of visibility, we are able to analyze…
We propose a simple derivation of an upper bound for the perimeter of an ellipse. The procedure, which relies on the use of elliptic integrals, consists in introducing, via inequalities and convexity properties, specific integrals which can…
In this paper we study the problem of maximizing the distance to a given point $C_0$ over a polytope $\mathcal{P}$. Assuming that the polytope is circumscribed by a known ball we construct an intersection of balls which preserves the…
The Flatness theorem states that the maximum lattice width ${\rm Flt}(d)$ of a $d$-dimensional lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm for integer programming in fixed dimension, and much work has…
We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…
Let $\mbox{Len}(K)$ be the minimum length of a knot on the cubic lattice (namely the minimum length necessary to construct the knot in the cubic lattice). This paper provides upper bounds for $\mbox{Len}(K)$ of a nontrivial knot $K$ in…
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 derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
In this note the following is shown. Consider the quadratic form on (complex) matrices Q(A):=tr(A^2). Let A be such a matrix. Then an ellipse can be found, with the vector from center to focus determined by the value of Q at the traceless…
We consider first-passage percolation on the $d$ dimensional cubic lattice for $d \geq 2$; that is, we assign independently to each edge $e$ a nonnegative random weight $t_e$ with a common distribution and consider the induced random graph…
We report on a lattice investigation of heavy meson interactions and of tetraquark candidates with two very heavy quarks. These two quarks are treated in the static limit, while the other two are up, down, strange or charm quarks of finite…
We give a simple formula for the signature of a foldable triangulation of a lattice polygon in terms of its boundary. This yields lower bounds on the number of real roots of certain of systems of polynomial equations known as "Wronski…
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…
Each straight infinite line defined by two vertices of a finite square point lattice contains (covers) these two points and a - possibly empty - subset of points that happen to be collinear to these. This work documents vertex subsets of…
We establish the most general form of the discrete elasticity of a 2D triangular lattice embedded in three dimensions, taking into account up to next-nearest neighbour interactions. Besides crystalline system, this is relevant to biological…
Aiming at the study of critical phenomena in the presence of boundaries with a non-trivial shape we discuss how lattices with an adaptive lattice spacing can be implemented. Since the parameters of the Hamiltonian transform non-trivially…