Lattice points in high-dimensional spheres

DOI10.1007/BF01571276zbMath0719.11063MaRDI QIDQ2639900

J. E. Mazo, Andrew M. Odlyzko

Publication date: 1990

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/178485

zbMATH Keywords

lattice pointstheta functionshigh-dimensional spheres

Mathematics Subject Classification ID

Waring's problem and variants (11P05) Lattice points in specified regions (11P21) Lattice packing and covering (number-theoretic aspects) (11H31)

Related Items

Comments on the holographic description of Narain theories, Some results on the asymptotic behaviour of coefficients of large powers of functions, Counting lattice points in pyramids, The F-theory geometry with most flux vacua, Low-density attack revisited, Solving low-density multiple subset sum problems with SVP oracle, On the number of lattice points in a small sphere and a recursive lattice decoding algorithm, New Definition of Density on Knapsack Cryptosystems, Improved broadcast attacks against subset sum problems via lattice oracle, Combinatorics of the Gauss digitization under translation in 2D, Lower bounds of shortest vector lengths in random NTRU lattices, On the packing densities of superballs and other bodies, On the covering multiplicity of lattices, Explicit Tauberian estimates for functions with positive coefficients, Minimal conditions for consistent variable selection in high dimension, Improved low-density subset sum algorithms, Generating shorter bases for hard random lattices, Random Sampling Revisited: Lattice Enumeration with Discrete Pruning, On the number of ways to occupy \(n\) lattice points by balls in \(d\)-dimensional space, Euclidean lattices, theta invariants, and thermodynamic formalism, Approximate set union via approximate randomization, Tight conditions for consistency of variable selection in the context of high dimensionality, Approximate CVP\(_p\) in time \(2^{0.802n}\), A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic, Hardness of bounded distance decoding on lattices in lp norms, Kissing Numbers and Transference Theorems from Generalized Tail Bounds, On the elliptic Calabi-Yau fourfold with maximal \(h^{1,1}\), An upper bound on the average number of iterations of the LLL algorithm

Cites Work

• Gitterpunkte in mehrdimensionalen Kugeln
• On a lattice point problem of L. Moser. I
• On universal quantization
• On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
• An improvement to the Minkowski‐Hiawka bound for packing superballs
• Solving low-density subset sum problems
• Minimal theta functions
• On lattice-points in a random sphere
• On the number of integer points in the displaced circles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item