Maximal 2-distance sets containing the regular simplex
From MaRDI portal
Publication:2198391
DOI10.1016/j.disc.2020.112071zbMath1447.05202arXiv1904.11351OpenAlexW3045067353MaRDI QIDQ2198391
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
Extremal set theory (05D05) Other designs, configurations (05B30) Erd?s problems and related topics of discrete geometry (52C10) General theory of distance geometry (51K05) Euclidean geometries (general) and generalizations (51M05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of Larman-Rogers-Seidel's theorem
- Bounds on three- and higher-distance sets
- The complete intersection theorem for systems of finite sets
- 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)\)
- The exact bound in the Erdős-Ko-Rado theorem
- Uniqueness of maximum planar five-distance sets
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Quasi-symmetric designs and self-dual codes
- Maximum planar sets that determine \(k\) distances
- Spherical codes and designs
- New maximal two-distance sets
- Upper bounds for \(s\)-distance sets and equiangular lines
- Classification of three-distance sets in two dimensional Euclidean space
- A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
- Constructions of maximum few-distance sets in Euclidean spaces
- Bounds on sets with few distances
- A note on the spherical embeddings of strongly regular graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Two-Distance Sets in Euclidean Space
- Strongly Regular Graphs Derived from Combinatorial Designs
This page was built for publication: Maximal 2-distance sets containing the regular simplex
