On the largest subsets avoiding the diameter of (0, 1)-vectors

DOI10.26493/1855-3974.935.4E0zbMATH Open1380.05190arXiv1509.01326OpenAlexW2964007093MaRDI QIDQ4597477FDOQ4597477

Saori Adachi, Hiroshi Nozaki

Publication date: 13 December 2017

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: Let $L_{mkl}subsetmathbb{R}^{m+k+l}$ be the set of vectors which have $m$ of entries $-1$, $k$ of entries $0$, and $l$ of entries $1$. In this paper, we investigate the largest subset of $L_{mkl}$ whose diameter is smaller than that of $L_{mkl}$. The largest subsets for $m=1$, $l=2$, and any $k$ will be classified. From this result, we can classify the largest $4$-distance sets containing the Euclidean representation of the Johnson scheme $J(9,4)$. This was an open problem in Bannai, Sato, and Shigezumi (2012).

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

Recommendations

• Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\)
• Radius and diameter in Manhattan lattices
• Constructions of maximum few-distance sets in Euclidean spaces
• scientific article
• Large sets of nearly orthogonal vectors

zbMATH Keywords

independent set\(s\)-distance setextremal set theorydiameter graphErdős-Ko-Rado theorem

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Extremal set theory (05D05)

Cited In (2)

• Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
• Radius and diameter in Manhattan lattices

This page was built for publication: On the largest subsets avoiding the diameter of \((0,\pm 1)\)-vectors

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