Maximal 2-distance sets containing the regular simplex

DOI10.1016/J.DISC.2020.112071MaRDI QIDQ2198391zbMATH OpenOpenAlexFDO

Authors Hiroshi Nozaki, Masashi Shinohara

Publication date 10 September 2020

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

maximal distance setquasi-symmetric design

Mathematics Subject Classification ID

Other designs, configurations (05B30) Extremal set theory (05D05) General theory of distance geometry (51K05) Euclidean geometries (general) and generalizations (51M05) Erd?s problems and related topics of discrete geometry (52C10)

Abstract: A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while maintaining the $m$-distance condition. We investigate a necessary and sufficient condition for vectors to be added to a regular simplex such that the set has only $2$ distances. We construct several $d$-dimensional maximal $2$-distance sets that contain a $d$-dimensional regular simplex. In particular, there exist infinitely many maximal non-spherical $2$-distance sets that contain both the regular simplex and the representation of a strongly resolvable design. The maximal $2$-distance set has size $2s^2(s+1)$, and the dimension is $d=(s-1)(s+1{)}^2-1$, where $s$ is a prime power.

Recommendations

• Regular two-distance sets
• New maximal two-distance sets
• A generalization of Larman-Rogers-Seidel's theorem
• Spherical two-distance sets
• Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)

Cites work

• A generalization of Larman-Rogers-Seidel's theorem
• A note on the spherical embeddings of strongly regular graphs
• A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Bounds on sets with few distances
• Bounds on three- and higher-distance sets
• Characterization of quasi-symmetric designs with eigenvalues of their block graphs
• Classification of three-distance sets in two dimensional Euclidean space
• Constructions of maximum few-distance sets in Euclidean spaces
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3874093 (Why is no real title available?)
• scientific article; zbMATH DE number 3827893 (Why is no real title available?)
• scientific article; zbMATH DE number 3783021 (Why is no real title available?)
• scientific article; zbMATH DE number 51841 (Why is no real title available?)
• scientific article; zbMATH DE number 3234139 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
• Maximal m-distance sets containing the representation of the Johnson graph J(n,m)
• Maximum planar sets that determine k distances
• New maximal two-distance sets
• On Two-Distance Sets in Euclidean Space
• Quasi-symmetric designs and self-dual codes
• Spherical codes and designs
• Strongly Regular Graphs Derived from Combinatorial Designs
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• Uniqueness of maximum planar five-distance sets
• Upper bounds for \(s\)-distance sets and equiangular lines

Cited in

(8)

• Representation of frames as regular \(k\)-distance sets
• Biangular lines revisited
• Sets of tetrahedra, defined by maxima of distance functions
• Euclidean sets with only one distance modulo a prime ideal
• On the two-distance embedding in real Euclidean space of coherent configuration of type (2,2;3)
• Maximal m-distance sets containing the representation of the Johnson graph J(n,m)
• Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
• Regular two-distance sets

This page was built for publication: Maximal 2-distance sets containing the regular simplex

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