Bounds for the sum of distances of spherical sets of small size
From MaRDI portal
Publication:2689513
DOI10.1016/j.disc.2023.113346OpenAlexW4320169614MaRDI QIDQ2689513
Alexander Barg, P. G. Boyvalenkov, M. M. Stoyanova
Publication date: 10 March 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.03511
Theory of error-correcting codes and error-detecting codes (94Bxx) Graph theory (05Cxx) General convexity (52Axx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Spherical distribution of 5 points with maximal distance sum
- Spectra of graphs
- Universal lower bounds for potential energy of spherical codes
- On the construction of equiangular frames from graphs
- Strongly regular graphs having strongly regular subconstituents
- Designs as maximum codes in polynomial metric spaces
- Spherical codes and designs
- Extremal dispositions of the points on the sphere
- Large equiangular sets of lines in euclidean space
- Upper bounds for \(s\)-distance sets and equiangular lines
- Equiangular lines and spherical codes in Euclidean space
- An introduction to finite tight frames
- Finite normalized tight frames
- Equiangular lines with a fixed angle
- Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines
- Upper bounds for energies of spherical codes of given cardinality and separation
- Graph representations, two-distance sets, and equiangular lines
- Stolarsky's invariance principle for projective spaces
- Energy bounds for codes in polynomial metric spaces
- Finite two-distance tight frames
- Large sets of complex and real equiangular lines
- The weight distributions of two classes of binary cyclic codes
- The Stolarsky principle and energy optimization on the sphere
- Equiangular lines
- A note on the spherical embeddings of strongly regular graphs
- A simple proof of Stolarsky’s invariance principle
- On the sum of distances determined by a pointset
- Sums of distances between points on a sphere — an application of the theory of irregularities of distribution to discrete Geometry
- Universally optimal distribution of points on spheres
- The Geometry of Two-Weight Codes
- Asymptotics for minimal discrete energy on the sphere
- On the Fejes Tóth problem about the sum of angles between lines
- Binary Linear Codes With Few Weights From Two-to-One Functions
- Strongly Regular Graphs
- Sums of Distances Between Points on a Sphere. II
- POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES
- Discrete Energy on Rectifiable Sets
- Universal upper and lower bounds on energy of spherical designs
- One-bit sensing, discrepancy and Stolarsky's principle
- The next-order term for optimal Riesz and logarithmic energy asymptotics on the sphere
- On the sum of distances betweenn points on a sphere
- STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
This page was built for publication: Bounds for the sum of distances of spherical sets of small size