Related papers: Lattice points in spherical segments
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…
Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…
We give a sharp upper diameter bound for a compact shrinking Ricci soliton in terms of its scalar curvature integral and the Perelman's entropy functional. The sharp cases could occur at round spheres. The proof mainly relies on a sharp…
Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…
In this paper, we study additive properties of finite sets of lattice points on spheres in $3$ and $4$ dimensions. Thus, given $d,m \in \mathbb{N}$, let $A$ be a set of lattice points $(x_1, \dots, x_d) \in \mathbb{Z}^d$ satisfying $x_1^2 +…
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…
Given a discrete lattice, $\Gamma < \operatorname{SL}_m(\mathbb{R})$, and a base point $o \in \mathbb{R}^m$, let $N_\Gamma(T)$ denote the number of points in the orbit $o \cdot \Gamma $ whose (Euclidean) length is bounded by a growing…
For integers $1 < k < d-1$ and $r \ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of…
Let x be a point in R^2 with irrational slope and let \Gamma denote the lattice SL(2,Z) acting linearly on R^2. Then, the orbit \Gamma x is dense in R^2. We give efective results on the approximation of a point y in R^2 by points of the…
We prove various estimates for the mean square lattice point discrepancy for dilates of a convex body.
A higher dimensional lattice space can be decomposed into a number of four-dimensional lattices called as layers. The higher dimensional gauge theory on the lattice can be interpreted as four-dimensional gauge theories on the multi-layer…
In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…
The more exact upper estimate of the percolation threshold for the {\it site problem} on the quadratic lattice ${\Bbb Z}^2$ have been found on the basis of the cluster decomposition. It is done by the number estimate of cycles on ${\Bbb…
We use spectral analysis to give an asymptotic formula for the number of matrices in SL(n, Z) of height at most T with strong error terms, far beyond the previous known, both for small and large rank.
Motivated by a recent question of Peyre, we apply the Hardy-Littlewood circle method to count "sufficiently free" rational points of bounded height on arbitrary smooth projective hypersurfaces of low degree that are defined over the…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We show that for a suitable class of functions of finitely-many variables, the limit of integrals along slices of a high dimensional sphere is a Gaussian integral on a corresponding finite-codimension affine subspace in infinite dimensions.
For a convex body B in three-dimensional Euclidean space, which is invariant under rotations around one coordinate axis and has a smooth boundary of bounded nonzero curvature, the lattice point discrepancy (number of integer points minus…
We propose a novel method for determining the radius of a spherical surface based on the distances measured between points on this surface. We consider the most general case of determining the radius when the distances are measured with…
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…