Tverberg's theorem, disks, and Hamiltonian cycles (Q825963): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3205921174 / rank
 
Normal rank

Revision as of 00:37, 20 March 2024

scientific article
Language Label Description Also known as
English
Tverberg's theorem, disks, and Hamiltonian cycles
scientific article

    Statements

    Tverberg's theorem, disks, and Hamiltonian cycles (English)
    0 references
    0 references
    0 references
    18 December 2021
    0 references
    \textit{H. Tverberg} proved [J. Lond. Math. Soc. 41, 123--128 (1966; Zbl 0131.20002)] that for any set of \((r-1)(d+1)+1\) points in \(\mathbb{R}^d\) there exists a partition of them into \(r\) parts whose convex hulls intersect Such partitions are called Tverberg partitions. The paper studies a variant of Tverberg partitions. For a segment \(e\) in \(\mathbb{R}^d\) with endpoints \(x, y\), we denote by \(D(e)\) the closed ball for which \(e\) is a diameter. Given a finite set of points in \(\mathbb{R}^d\), instead of looking at the convex hulls of its subsets, the paper is interested in the balls spanned by pairs of the points. Given a graph on a finite point set as a vertex set, the graph is called Tverberg, if the intersection of balls associated with the edges of the graph is non-empty. The main result of the paper is that a finite point set of odd cardinality has a Tverberg Hamiltonian cycle, while a finite point set of even cardinality has a Tverberg Hamiltonian path.
    0 references
    Tverberg's theorem
    0 references
    finite point set
    0 references
    partition
    0 references
    Radon's theorem
    0 references
    ball
    0 references

    Identifiers