Related papers: The lattice discrepancy of certain three-dimension…
In this article we establish an asymptotic formula for the number of rational points, with bounded denominators, within a given distance to a compact submanifold $\mathcal{M}$ of $\mathbb{R}^M$ with a certain curvature condition. Our result…
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…
We construct convergent and divergent lattices in negative curvature and give a precise asymptotic description of the behavior of their counting function.
We consider random lattices taken from the general symplectic ensemble and count the number of lattice points of a typical lattice in nested families $B_t$ of certain Borel sets. Our main result is that for almost every general symplectic…
We study a lattice point counting problem for spheres arising from the Heisenberg groups. In particular, we prove an upper bound on the number of points on and near large dilates of the unit spheres generated by the anisotropic norms…
Grey-scale local algorithms have been suggested as a fast way of estimating surface area from grey-scale digital images. Their asymptotic mean has already been described. In this paper, the asymptotic behaviour of the variance is studied in…
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…
Determining the positions of lattice defects on elastic surfaces with Gaussian curvature is a non-trivial task of mechanical energy optimization, particularly for surfaces with boundaries. We introduce a simple way to predict the onset of…
We study limit shapes for dimer models on domains of the hexagonal lattice with free boundary conditions. This is equivalent to the large deviation phenomenon for a random stepped surface over domains fixed only at part of the boundary.
A theoretical approach is described for an exact numerical treatment of a pair of ultracold atoms interacting via a central potential that are trapped in a finite three-dimensional optical lattice. The coupling of center-of-mass and…
The difference between the number of lattice points in a disk of radius $\sqrt{t}/2\pi$ and the area of the disk $t/4\pi$ is equal to the error in the Weyl asymptotic estimate for the eigenvalue counting function of the Laplacian on the…
Lattice Boltzmann models are briefly introduced together with references to methods used to predict their ability for simulations of systems described by partial differential equations that are first order in time and low order in space…
Gardner, Gronchi and Zong posed the problem to find a discrete analogue of M. Meyer's inequality bounding the volume of a convex body from below by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated…
Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
We describe the structure of the asymptotic lines near an inflection point of a Lagrangean surface, proving that in the generic situation it corresponds to two of the three possible cases when the discriminant curve has a cusp singularity.…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
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…
Given any full rank lattice and a natural number N , we regard the point set given by the scaled lattice intersected with the unit square under the Lambert map to the unit sphere, and show that its spherical cap discrepancy is at most of…
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…