Constructions of maximum few-distance sets in Euclidean spaces

DOI10.37236/8565MaRDI QIDQ2290349zbMATH OpenOpenAlexFDO

Authors Ferenc Szöllősi, Patric R. J. Östergård

Publication date 27 January 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1804.06040, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p23

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Euclidean spacefew-distance setmaximal cardinality

Mathematics Subject Classification ID

Enumerative problems (combinatorial problems) in algebraic geometry (14N10) General theory of distance geometry (51K05) Erd?s problems and related topics of discrete geometry (52C10)

Abstract: A finite set of distinct vectors $mathcalX$ in the $d$-dimensional Euclidean space $mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $mathcalX$ has cardinality $s$. In this paper we present a combined approach of isomorph-free exhaustive generation of graphs and Gr"obner basis computation to classify the largest $3$-distance sets in $mathbb{R}^4$, the largest $4$-distance sets in $mathbb{R}^3$, and the largest $6$-distance sets in $mathbb{R}^2$. We also construct new examples of large $s$-distance sets for $dleq8$ and $sleq6$, and independently verify several earlier results from the literature.

Review text

This paper focuses on the problem of determining, given the natural numbers \(d\) and \(s\), the largest finite subsets of vectors in \(\mathbb{R}^d\) for which the set of mutual distances between distinct vectors has cardinality \(s\). More precisely, the authors focus primarly on the case \(d=4\) and \(s=3\), but also on the cases \(d=3\) and \(s=4\), \(d=3\) and \(s=3\), and \(d=2\) and \(s=6\), respectively. The given proofs are based on classical graph generation techniques and on elements of computational commutative algebra. Other related examples are also discussed.

Recommendations

• scientific article; zbMATH DE number 3153711
• Extremal problems for the distance between elements of two sets
• scientific article; zbMATH DE number 4214837
• Bounds on sets with few distances
• scientific article; zbMATH DE number 3895787
• Bounding the Size of an Almost-Equidistant Set in Euclidean Space
• scientific article; zbMATH DE number 1234826
• Optimal point sets determining few distinct distances in three-dimensional Euclidean space \(\mathbb{E}^3\)
• scientific article; zbMATH DE number 3977019
• On Sets of Distances of n Points

Cites work

• A generalization of Larman-Rogers-Seidel's theorem
• An introduction to finite tight frames
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Bounds on three- and higher-distance sets
• Classification algorithms for codes and designs
• Classification of association schemes of small order
• CoCoALib: A C++ library for computations in commutative algebra and beyond
• Constructions of biangular tight frames and their relationships with equiangular tight frames
• Equiangular lines
• Euclidean distance geometry and applications
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Excursions into combinatorial geometry
• scientific article; zbMATH DE number 3874093 (Why is no real title available?)
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 3827893 (Why is no real title available?)
• scientific article; zbMATH DE number 1224949 (Why is no real title available?)
• scientific article; zbMATH DE number 2019938 (Why is no real title available?)
• scientific article; zbMATH DE number 3234139 (Why is no real title available?)
• scientific article; zbMATH DE number 3331438 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• On Two-Distance Sets in Euclidean Space
• Packings in real projective spaces
• Spherical two-distance sets
• The CRC handbook of combinatorial designs
• The near resolvable 2-(13,4,3) designs and thirteen-player whist tournaments

Cited in

(20)

• New maximal two-distance sets
• Classification of three-distance sets in two dimensional Euclidean space
• A proof of a dodecahedron conjecture for distance sets
• Maximal 2-distance sets containing the regular simplex
• Biangular lines revisited
• An upper bound for the cardinality of an s-distance set in Euclidean space
• Classification of partially metric Q-polynomial association schemes with \(m_1=4\)
• The two-distance sets in dimension four
• On the largest subsets avoiding the diameter of (0, 1)-vectors
• Bounding the Size of an Almost-Equidistant Set in Euclidean Space
• A generalization of Larman-Rogers-Seidel's theorem
• Nearly k-distance sets
• Optimal point sets determining few distinct angles
• Embedding dimensions of matrices whose entries are indefinite distances in the pseudo-Euclidean space
• Bounds on three- and higher-distance sets
• Semidefinite programming bounds for spherical three-distance sets
• Euclidean sets with only one distance modulo a prime ideal
• 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)\)
• General embedding problems and two-distance sets in Minkowski planes

Describes a project that uses

Uses Software

• CoCoALib
• Cliquer

This page was built for publication: Constructions of maximum few-distance sets in Euclidean spaces

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