On Borsuk's conjecture for two-distance sets (Q2249469): Difference between revisions

From MaRDI portal
Created claim: DBLP publication ID (P1635): journals/dcg/Bondarenko14, #quickstatements; #temporary_batch_1731475607626
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s00454-014-9579-4 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00454-014-9579-4 / rank
 
Normal rank

Latest revision as of 16:40, 17 December 2024

scientific article
Language Label Description Also known as
English
On Borsuk's conjecture for two-distance sets
scientific article

    Statements

    On Borsuk's conjecture for two-distance sets (English)
    0 references
    1 July 2014
    0 references
    For \(n \in \mathbb{N}\), \(b(n)\) denotes the smallest number \(k\) such that every bounded set of positive diameter in Euclidean space \(\mathbb{E}^n\) can be split into \(k\) subsets of smaller diameter. Borsuk asked if \(b(n)=n+1\) [\textit{K. Borsuk}, Fundam. Math. 20, 177--190 (1933; Zbl 0006.42403)]. The author shows that \(b(n)>n+1\) for all \(n \geq 65\). His estimates are mainly based on Euclidean representations of strongly regular graphs, which give finite sets in \(\mathbb{E}^n\) the mutual distances of whose points attain only two values. It is remarked that the answer to Borsuk's question is also negative for \(n=64\); namely, \(b(64) \geq 72\).
    0 references
    Borsuk's problem
    0 references
    two-distance set
    0 references
    strongly regular graph
    0 references
    Euclidean representation of graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references