2000 character limit reached
Lattice points in spherical segments (1912.10462v2)
Published 22 Dec 2019 in math.NT
Abstract: 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 segment by hyperplanes of rational direction, and then cover an arbitrary segment with one having rational direction. Diophantine approximation can be used to obtain the best rational direction possible.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
