On a generalization of distance sets

DOI10.1016/J.JCTA.2009.11.001MaRDI QIDQ986118zbMATH OpenOpenAlexFDO

Authors 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

metric geometryspherical designdistance set

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Abstract: A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distinct distances between two distinct points in $X$ and a subset $X$ is called a locally $k$-distance set if for any point $x$ in $X$, there are at most $k$ distinct distances between $x$ and other points in $X$. Delsarte, Goethals, and Seidel gave the Fisher type upper bound for the cardinalities of $k$-distance sets on a sphere in 1977. In the same way, we are able to give the same bound for locally $k$-distance sets on a sphere. In the first part of this paper, we prove that if $X$ is a locally $k$-distance set attaining the Fisher type upper bound, then determining a weight function $w$, $(X,w)$ is a tight weighted spherical $2k$-design. This result implies that locally $k$-distance sets attaining the Fisher type upper bound are $k$-distance sets. In the second part, we give a new absolute bound for the cardinalities of $k$-distance sets on a sphere. This upper bound is useful for $k$-distance sets for which the linear programming bound is not applicable. In the third part, we discuss about locally two-distance sets in Euclidean spaces. We give an upper bound for the cardinalities of locally two-distance sets in Euclidean spaces. Moreover, we prove that the existence of a spherical two-distance set in $(d-1)$-space which attains the Fisher type upper bound is equivalent to the existence of a locally two-distance set but not a two-distance set in $d$-space with more than $d(d+1)/2$ points. We also classify optimal (largest possible) locally two-distance sets for dimensions less than eight. In addition, we determine the maximum cardinalities of locally two-distance sets on a sphere for dimensions less than forty.

Recommendations

• Bounds on three- and higher-distance sets
• Spherical two-distance sets
• Bounds on \(s\)-distance sets with strength \(t\)
• A generalization of Larman-Rogers-Seidel's theorem
• Upper bounds for \(s\)-distance sets and equiangular lines

Cites work

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

Cited in

(28)

• scientific article; zbMATH DE number 3895787 (Why is no real title available?)
• Representation of frames as regular \(k\)-distance sets
• A note on average distances in digital sets
• Distance structures for generalized metric spaces
• On Falconer's distance set conjecture
• Bounds on sets with few distances
• An asymmetric bound for sum of distance sets
• Quasiextremal distance sets
• Some connections between Falconer's distance set conjecture and sets of Furstenburg type
• On distinct distances among points in general position and other related problems
• Inside s-inner product sets and Euclidean designs
• On the size of maximal binary codes with 2, 3, and 4 distances
• Distance measures for well-distributed sets
• A survey on spherical designs and algebraic combinatorics on spheres
• Characterization of set relations through extensions of the oriented distance
• Bounds on \(s\)-distance sets with strength \(t\)
• scientific article; zbMATH DE number 3950241 (Why is no real title available?)
• scientific article; zbMATH DE number 6729324 (Why is no real title available?)
• scientific article; zbMATH DE number 3874093 (Why is no real title available?)
• Some generalizations of distality
• scientific article; zbMATH DE number 3149575 (Why is no real title available?)
• Distance with generalized neighbourhood sequences in n D and D
• Ranks of matrices with few distinct entries
• On the distance sets of Ahlfors-David regular sets
• scientific article; zbMATH DE number 4188746 (Why is no real title available?)
• Bounds on three- and higher-distance sets
• Distance Between Sets - A survey
• Spherical two-distance sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986118)