Related papers: Lattice points in spherical segments

Rudin conjectured that there are never more than c N^(1/2) squares in an arithmetic progression of length N. Motivated by this surprisingly difficult problem we formulate more than twenty conjectures in harmonic analysis, analytic number…

A problem of scattering by a Dirichlet right angle on a discrete square lattice is studied. The waves are governed by a discrete Helmholtz equation. The solution is looked for in the form of the Sommerfeld integral. The Sommerfeld…

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…

We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…

We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.

A celebrated result of Legendre and Gauss determines which integers can be represented as a sum of three squares, and for those it is typically the case that there are many ways of doing so. These different representations give collections…

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 improve a bound due to the second author on number of rational points on smooth surfaces in $\mathbb{P}^3$ over finite fields and look at families of surfaces that achieve or nearly achieve this bound, for which we compute their exact…

We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

We study the hexagonal lattice $\mathbb{Z}[\omega]$, where $\omega^6=1$. More specifically, we study the angular distribution of hexagonal lattice points on circles with a fixed radius. We prove that the angles are equidistributed on…

We derive a sharp scaling law for deviations of edge-isoperimetric sets in the lattice $\mathbb Z^d$ from the limiting Wulff shape in arbitrary dimensions. As the number $n$ of elements diverges, we prove that the symmetric difference to…

This paper is a follow-up to the recent paper "A note on isotropic discrepancy and spectral test of lattice point sets" [J. Complexity, 58:101441, 2020]. We show that the isotropic discrepancy of a lattice point set is at most $d \,…

In a recent article, we have shown that a variety of localized polynomial frames, including isotropic as well as directional systems, are suitable for detecting jump discontinuities along circles on the sphere. More precisely, such edges…

We give a description of the lower part of the spectrum of the Dirichlet Laplacian in an unbounded 3D periodic lattice made of thin bars (of width $\varepsilon\ll1$) which have a square cross section. This spectrum coincides with the union…

We will show that for any $n\ge N$ points on the $N$-dimensional sphere $S^N$ there is a closed hemisphere which contains at least $\lfloor\frac{n+N+1}{2}\rfloor$ of these points. This bound is sharp and we will calculate the amount of sets…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

In this paper we explicitly estimate the number of points in a subset $A \subset \R^{d}$ as a function of the maximum angle $\angle A$ that any three of these points form, provided $\angle A < \theta_d := \arccos(-\frac 1 {d}) \in…