scientific article; zbMATH DE number 3633251
From MaRDI portal
Publication:4194048
Cited in
(99)- On character sums and codes
- Finite sphere packing and sphere covering
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- A lower bound in the \(abc\) conjecture
- The Gaussian core model in high dimensions
- Upper bounds for \(s\)-distance sets and equiangular lines
- On kissing numbers and spherical codes in high dimensions
- Approximating Steiner trees and forests with minimum number of Steiner points
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Sausages are good packings
- Kissing numbers and the centered maximal operator
- Optimal line packings from nonabelian groups
- Packings, sausages and catastrophes
- Free partition functions and an averaged holographic duality
- Approximate CVP\(_p\) in time \(2^{0.802n}\)
- Zeros of Rankin-Selberg \(L\)-functions at the edge of the critical strip
- Best and random approximation of a convex body by a polytope
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
- Negative curves of small genus on surfaces
- A note on Schwartz functions and modular forms
- Contact graphs of ball packings
- On the number of weakly connected subdigraphs in random \(k\)NN digraphs
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- Localization near the edge for the Anderson Bernoulli model on the two dimensional lattice
- Sphere packing and quantum gravity
- Exponential improvements for superball packing upper bounds
- A lower bound for the rank of a universal quadratic form with integer coefficients in a totally real number field
- Bounds on sets with few distances
- Orthogonal and diagonal dimension fluxes of hyperspherical function
- Sphere packings revisited
- The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
- High-dimensional sphere packing and the modular bootstrap
- A short solution of the kissing number problem in dimension three
- The irreducible vectors of a lattice: some theory and applications
- Finding shortest lattice vectors in the presence of gaps
- Selected open problems in discrete geometry and optimization
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- Lectures on applied ℓ-adic cohomology
- Coloring the Voronoi tessellation of lattices
- Approximating Steiner trees and forests with minimum number of Steiner points
- Contact numbers for congruent sphere packings in Euclidean 3-space
- Two new constructions of approximately mutually unbiased bases
- On the hard sphere model and sphere packings in high dimensions
- scientific article; zbMATH DE number 6866338 (Why is no real title available?)
- Square-free values of \(f(p)\), \(f\) cubic
- Eigenfunctions of the Fourier transform with specified zeros
- Asymptotic bounds for spherical codes
- Exact Semidefinite Programming Bounds for Packing Problems
- Kissing number in non-Euclidean spaces of constant sectional curvature
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- Interview with Yufei Zhao
- Kissing numbers of closed hyperbolic manifolds
- Integral points on the congruent number curve
- Kissing numbers and transference theorems from generalized tail bounds
- Spherical codes, maximal local packing density, and the Golden ratio
- Ball packings with high chromatic numbers from strongly regular graphs
- A Note on Lattice Packings via Lattice Refinements
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- Bounds for spherical codes: the Levenshtein framework lifted
- Approximate CVP_p in Time 2^{0.802 n}
- Abelian varieties and a Minkowski-Hlawka theorem
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances
- Delsarte’s extremal problem and packing on locally compact Abelian groups
- STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
- The relational translators of the hyperspherical functional matrix
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- The magic of 8 and 24
- A quantitative stability result for the sphere packing problem in dimensions 8 and 24
- Piercing translates and homothets of a convex body
- Bounds on three- and higher-distance sets
- Small codes
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere
- Annulus graphs in \(\mathbb{R}^d\)
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- New upper bounds for spherical codes and packings
- Optimizers of three-point energies and nearly orthogonal sets
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- Localization and unique continuation for non-stationary Schrödinger operators on the 2D lattice
- On the ability to approximate k-DSP of HKZ, BKZ and slide reduction
- Azadkia-Chatterjee's dependence coefficient for infinite dimensional data
- New lower bounds on kissing numbers and spherical codes in high dimensions
- On the existence of an extremal function for the Delsarte extremal problem
- Uniacute spherical codes
- On a Gallai-type problem and illumination of spiky balls and cap bodies
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- New lower bound on ball packing density in high-dimensional hyperbolic spaces
- Bounds on hyperbolic sphere packings: on a conjecture by Cohn and Zhao
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
- Error resilient space partitioning (invited talk)
- Lattice packing of spheres in high dimensions using a stochastically evolving ellipsoid
- Fourier inequalities and sign uncertainty
- Universal lower bounds for potential energy of spherical codes
- Triangles improve 0.878 approximation for Maxcut
- On the sphericity and cubicity of graphs
- A bound on Grassmannian codes
- Finding shortest lattice vectors faster using quantum search
- Linear programming bounds for regular graphs
- Power-free values, large deviations, and integer points on irrational curves
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4194048)