Related papers: Estimates on Lattice Points in the Circle
We present a method of computing any one-loop integral in lattice perturbation theory by systematically expanding around its continuum limit. At any order in the expansion in the lattice spacing, the result can be written as a sum of…
A novel method to calculate f_B on the lattice is introduced, based on the study of the dependence of finite size effects upon the heavy quark mass of flavoured mesons and on a non-perturbative recursive finite size technique. We avoid the…
If $\mathcal{B}\subset \mathbb{R}^d$ ($d\geqslant 2$) is a compact convex domain with a smooth boundary of finite type, we prove that for almost every rotation $\theta\in SO(d)$ the remainder of the lattice point problem, $P_{\theta…
In this article, we devise a concise algorithm for computing BOCP. Our method is simple, easy-to-implement but without loss of efficiency. Given two circular-arc polygons with $m$ and $n$ edges respectively, our method runs in…
The dispersion of a point set in the unit square is defined to be the area of the largest empty axis-parallel box. In this paper we are interested in the dispersion of lattices in the plane, that is, the supremum of the area of the empty…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
Let $\Gamma$ be a cocompact discrete subgroup of $\mathrm{PSL}_{2}(\mathbb{C})$ and denote by $\mathcal{H}$ the three dimensional upper half-space. For a $p\in\mathcal{H}$, we count the number of points in the orbit $\Gamma p$, according to…
We give a new algorithm using linear approximation and lattice reduction to efficiently calculate all rational points of small height near a given plane curve C. For instance, when C is the Fermat cubic, we find all integer solutions of…
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the --exact…
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…
Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…
We introduce maximal and average coherence on lattices by analogy with these notions on frames in Euclidean spaces. Lattices with low coherence can be of interest in signal processing, whereas lattices with high orthogonality defect are of…
A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…
We derive a formula for the number of lattice points in type B generalized permutohedra, providing a concise alternative to the formula obtained recently by Eur, Fink, Larson, and Spink as a result from a study of delta-matroids. Our…
This paper treats triangles in the plane whose vertices lie on the integer lattice, i.e., the vertices have integer coordinates. It shows that apart from trivial examples, the circumcenter, centroid and orthocenter of such triangles never…
We consider a square expanding with constant speed seen from an observer moving away with constant acceleration and study the distribution of angles between rays from the observer towards the lattice points in the square. We prove the…
Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes…
We comment on the set of visible points of a lattice and its Fourier transform, thus continuing and generalizing previous work by Schroeder and Mosseri. A closed formula in terms of Dirichlet series is obtained for the Bragg part of the…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
A marked lattice is a $d$-dimensional Euclidean lattice, where each lattice point is assigned a mark via a given random field on ${\mathbb Z}^d$. We prove that, if the field is strongly mixing with a faster-than-logarithmic rate, then for…