Bounds on s-distance sets with strength t

DOI10.1137/100807053MaRDI QIDQ3225148zbMATH OpenOpenAlexFDO

Authors Hiroshi Nozaki, Sho Suda

Publication date 15 March 2012

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(Q\)-polynomial association scheme\(s\)-distance set\(t\)-designabsolute boundcometric association schemefew distance setstrongly regular graphtwo-point-homogeneous space

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorial geometries and geometric closure systems (51D20)

Abstract: A finite set $X$ in the Euclidean unit sphere is called an $s$-distance set if the set of distances between any distinct two elements of $X$ has size $s$. We say that $t$ is the strength of $X$ if $X$ is a spherical $t$-design but not a spherical $(t+1)$-design. Delsarte-Goethals-Seidel gave an absolute bound for the cardinality of an $s$-distance set. The results of Neumaier and Cameron-Goethals-Seidel imply that if $X$ is a spherical 2-distance set with strength 2, then the known absolute bound for 2-distance sets is improved. This bound are also regarded as that for a strongly regular graph with the certain condition of the Krein parameters. In this paper, we give two generalizations of this bound to spherical $s$-distance sets with strength $t$ (more generally, to $s$-distance sets with strength $t$ in a two-point-homogeneous space), and to $Q$-polynomial association schemes. First, for any $s$ and $s-1leqtleq2s-2$, we improve the known absolute bound for the size of a spherical $s$-distance set with strength $t$. Secondly, for any $d$, we give an absolute bound for the size of a $Q$-polynomial association scheme of class $d$ with the certain conditions of the Krein parameters.

Recommendations

• Bounds on three- and higher-distance sets
• Upper bounds for \(s\)-distance sets and equiangular lines
• New Bounds for Spherical Two-Distance Sets
• Bounds on antipodal spherical designs with few angles
• On a generalization of distance sets

Cited in

(9)

• Upper bounds for \(s\)-distance sets and equiangular lines
• An upper bound for the size of \(s\)-distance sets in real algebraic sets
• Bounds on antipodal spherical designs with few angles
• Classification of spherical 2-distance \(\{4,2,1\}\)-designs by solving Diophantine equations
• A note on the spherical embeddings of strongly regular graphs
• An upper bound for the cardinality of an s-distance set in Euclidean space
• A generalization of Gerzon's bound on spherical \(s\)-distance sets
• Bounds on three- and higher-distance sets
• On a generalization of distance sets

This page was built for publication: Bounds on \(s\)-distance sets with strength \(t\)

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