The Number of Lattice Points in a Set
From MaRDI portal
Publication:3234243
Cited in
(35)- On the generalized circle problem for a random lattice in large dimension
- Tosio Kato's work on non-relativistic quantum mechanics. I
- On the optimality of lattices for the Coppersmith technique
- Values of random polynomials at integer points
- On the value distribution of the Epstein zeta function in the critical strip
- Logarithm laws for one parameter unipotent flows
- Siegel-Veech transforms are in \(L^2\)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Rogers' mean value theorem for \(S\)-arithmetic Siegel transforms and applications to the geometry of numbers
- On the distribution of angles between increasingly many short lattice vectors
- The Erdős-Szüsz-Turán distribution for equivariant processes
- Bounding basis reduction properties
- Measure theory in the geometry of numbers
- Khintchine-type theorems for values of subhomogeneous functions at integer points
- On the distribution of lengths of short vectors in a random lattice
- Minkowski's theorem for random lattices
- Tosio Kato's work on non-relativistic quantum mechanics. II
- Higher-rank pointwise discrepancy bounds and logarithm laws for generic lattices
- Some results on random unimodular lattices
- On the value distribution and moments of the Epstein zeta function to the right of the critical strip
- The Measure of the Set of Admissible Lattices
- Random sampling revisited: lattice enumeration with discrete pruning
- Inhomogeneous Diophantine approximation for generic homogeneous functions
- Concrete security from worst-case to average-case lattice reductions
- Adelic Rogers integral formula
- Classification and statistics of cut-and-project sets
- On the Poisson distribution of lengths of lattice vectors in a random lattice
- Higher moment formulae and limiting distributions of lattice points
- On tiny-probability lattice enumeration
- A new random sampling method and its application in improving progressive BKZ algorithm
- Predicting module-lattice reduction
- Lattice packing of spheres in high dimensions using a stochastically evolving ellipsoid
- Solving the shortest vector problem in \(2^{0.63269n+o(n)}\) time on random lattices
- Deviations of ergodic sums for toral translations. II: Boxes
- On the most compact regular lattices in large dimensions: A statistical mechanical approach
This page was built for publication: The Number of Lattice Points in a Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3234243)