Lower bounds for spherical designs
From MaRDI portal
Publication:4382579
Numerical quadrature and cubature formulas (65D32) Other designs, configurations (05B30) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Theory of error-correcting codes and error-detecting codes (94B99) Appell, Horn and Lauricella functions (33C65)
Recommendations
Cited in
(18)- Quadrature points via heat kernel repulsion
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- Construction of spherical cubature formulas using lattices
- The sharp Jackson inequality in the space \(L_p\) on the sphere
- Optimal asymptotic bounds for spherical designs
- Lower bounds for projective designs, cubature formulas and related isometric embeddings
- Lower bound for the number of nodes of cubature formulae on the unit ball
- scientific article; zbMATH DE number 1505513 (Why is no real title available?)
- On lower bounds on the size of designs in compact symmetric spaces of rank 1
- Linear programming bounds for covering radius of spherical designs
- Optimal measures for \(p\)-frame energies on spheres
- Upper energy bounds for spherical designs of relatively small cardinalities
- On designs in compact metric spaces and a universal bound on their size
- A minimal design of order 11 on the 3-sphere
- A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs
- Efficient spherical designs with good geometric properties
- Distributing many points on spheres: minimal energy and designs
- A survey on spherical designs and algebraic combinatorics on spheres
This page was built for publication: Lower bounds for spherical designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382579)