Large simplices determined by finite point sets (Q1943341)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Large simplices determined by finite point sets |
scientific article |
Statements
Large simplices determined by finite point sets (English)
0 references
19 March 2013
0 references
For a finite set \(P\) in \(\mathbb{R}^n\) let \(d_1>d_2>\dotsb\) be all the distances spanned by \(P\) from the largest to the smallest. Previously, \textit{Z. Schur} et al. [Algorithms Comb. 25, 767--787 (2003; Zbl 1081.52016)] showed that there is at most one \(n\)-dimensional regular simplex with side length \(d_1\). In this paper, the result is extended: it is proved that the number of \(n\)-dimensional regular simplices with side length \(d_k\) is bounded by a function of \(n\) and \(k\) alone. The obtained bound is a tower of exponential of height \(\Omega(n)\). In addition, it is shown that in \(\mathbb{R}^3\) the distance \(d_k\) is realized at most \(c_k n\) times.
0 references
diameter graphs
0 references
distance graphs
0 references
large distances
0 references
regular simplices
0 references
number of cliques
0 references