On a generalization of distance sets

DOI10.1016/j.jcta.2009.11.001zbMath1228.05107arXiv0906.0199OpenAlexW2150322353MaRDI QIDQ986118

Hiroshi Nozaki, Masashi Shinohara

Publication date: 11 August 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.0199

zbMATH Keywords

spherical designmetric geometrydistance set

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items (4)

Ranks of matrices with few distinct entries ⋮ Inside s-inner product sets and Euclidean designs ⋮ Bounds on three- and higher-distance sets ⋮ A survey on spherical designs and algebraic combinatorics on spheres

Cites Work

• Unnamed Item
• Unnamed Item
• Uniqueness of maximum planar five-distance sets
• Spherical two-distance sets
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Fisher type inequalities for Euclidean t-designs
• Maximum planar sets that determine \(k\) distances
• Spherical codes and designs
• Tight spherical designs. I
• New maximal two-distance sets
• Distinct distances in finite planar sets
• A remarkable eight-point planar configuration
• Classification of three-distance sets in two dimensional Euclidean space
• On antipodal Euclidean tight \((2e+1)\)-designs
• On Euclidean tight 4-designs
• 9-Point and 7-Point Configurations in 3-Space
• Tight Spherical Disigns, II
• Cubature for the Sphere and the Discrete Spherical Harmonic Transform
• Four fundamental parameters of a code and their combinatorial significance
• The nonexistence of certain tight spherical designs

This page was built for publication: On a generalization of distance sets