Randomness in lattice point problems
This paper gives an interesting survey on various aspects of discrepancy theory and applications in combinatorial geometry. It starts with Roth's theorem on long arithmetic progressions, Van der Waerden's theorem on short arithmetic progressions and Schmidt's theorems on rectangles. Furthermore, various conjectures of Danzer, Erdős and Turán and of Erdős are mentioned. In the main part, the author refers to remarkable normal laws for certain types of lattice point counting functions. In the final part, the author discusses distribution results for continued fractions and applications to quadratic fields.
- A vectorizable random lattice
- Hyperuniform states of matter
- Elementary geometry on the integer lattice
- Randomness of the square root of 2 and the giant leap. I
- Central limit theorems for generic lattice point counting
- Pell equation and randomness
- Davenport's theorem in geometric discrepancy theory
- Effect of window shape on the detection of hyperuniformity via the local number variance
- scientific article; zbMATH DE number 7399652 (Why is no real title available?)
- Guest introduction
- scientific article; zbMATH DE number 2159063 (Why is no real title available?)
- The surprising accuracy of Benford's law in mathematics
- scientific article; zbMATH DE number 4182483 (Why is no real title available?)
- On low discrepancy sequences and low discrepancy ergodic transformations of the multidimensional unit cube
- Temporal central limit theorem for a multidimensional adding machine
This page was built for publication: Randomness in lattice point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5931444)