Lattice point counting and the probabilistic method
نویسندگان
چکیده
منابع مشابه
Lattice point counting and harmonic analysis
We explain the application of harmonic analysis to count lattice points in large regions. We also present some of our recent results in the three-dimensional case.
متن کاملThe Variance of the Hyperbolic Lattice Point Counting Function
The problem of estimating the number of points of a lattice that lie in a ball, is often called the circle problem. In the case of lattices in Euclidean space, this question goes back at least as far as Gauss. If we call Nρ the number of points of Z inside the ball B(0, ρ), then one easily sees that the leading term of Nρ is the area, πρ, of B(0, ρ). It is not difficult to show that the error t...
متن کاملThe number of configurations in lattice point counting I
When a strictly convex plane set S moves by translation, the set J of points of the integer lattice that lie in S changes. The number K of equivalence classes of sets J under lattice translations (configurations) is bounded in terms of the area of the Brunn-Minkowski difference set of S. If S satisfies the Triangle Condition, that no translate of S has three distinct lattice points in the bound...
متن کاملCovering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences
Let d and k be integers with 1 ≤ k ≤ d − 1. Let Λ be a d-dimensional lattice and let K be a d-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of k-dimensional linear subspaces needed to cover all points in Λ ∩ K. In particular, our results imply that the minimum number of k-dimensional linear subspaces needed to cover the d-dimensional n ×...
متن کاملCounting Connected Graphs and Hypergraphs via the Probabilistic Method
It is exponentially unlikely that a sparse random graph or hypergraph is connected, but such graphs occur commonly as the giant components of larger random graphs. This simple observation allows us to estimate the number of connected graphs, and more generally the number of connected d-uniform hypergraphs, on n vertices with m = O(n) edges. We also estimate the probability that a binomial rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2010
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2010.v1.n2.a6