STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
From MaRDI portal
Publication:6072670
DOI10.1112/mtk.12066zbMath1523.11137arXiv2005.12995OpenAlexW3110731718MaRDI QIDQ6072670
Publication date: 15 September 2023
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.12995
Related Items (2)
Bounds for the sum of distances of spherical sets of small size ⋮ Bounds for discrepancies in the Hamming space
Cites Work
- Energy bounds for codes and designs in Hamming spaces
- Universal lower bounds for potential energy of spherical codes
- Calkin's binomial identity
- Contributions to the geometry of Hamming spaces
- The spectrum of symmetric Krawtchouk matrices
- Upper bounds for energies of spherical codes of given cardinality and separation
- Stolarsky's invariance principle for projective spaces
- Bounds for \(L_p\)-discrepancies of point distributions in compact metric measure spaces
- Hyperuniform point sets on the sphere: deterministic aspects
- Energy bounds for codes in polynomial metric spaces
- The Stolarsky principle and energy optimization on the sphere
- A simple proof of Stolarsky’s invariance principle
- Energy-Minimizing Error-Correcting Codes
- Universally optimal distribution of points on spheres
- Hypergeometric Orthogonal Polynomials and Their q-Analogues
- The minimum of potential energy of a System of point charges
- Spherical Distributions of N Points with Maximal Distance Sums are well Spaced
- Estimates of the distance distribution of codes and designs
- On the Fejes Tóth problem about the sum of angles between lines
- POINT DISTRIBUTIONS IN COMPACT METRIC SPACES
- Binomial moments of the distance distribution: bounds and applications
- Sums of Distances Between Points on a Sphere. II
- POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES
- Geodesic distance Riesz energy on the sphere
- Discrete Energy on Rectifiable Sets
- One-bit sensing, discrepancy and Stolarsky's principle
- Geometric discrepancy. An illustrated guide
- On the minimum average distance of binary codes: Linear programming approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES