Tverberg's theorem

from Wikipedia, the free encyclopedia

The set of Tverberg ( English Tverberg's theorem ) is a theorem , both the mathematical field of convex geometry as well as that of the topological combinatorics attributable and in one of the Norwegian mathematician Helge Tverberg submitted in 1966, working back. It represents a generalization of the well-known radon theorem and is the starting point for a large number of more far-reaching studies. Closely related to it is Bárány’s theorem , from which Tverberg’s theorem can be derived.

Formulation of the sentence

Illustration for n = 2 and r = 3. N = 7 points allow a decomposition of the specified type.

The sentence says:

Let two natural numbers and the natural number be given . Was passed in Euclidean space is a subset consisting of at least spatial points are made to.
Then:
There is a decomposition
in pairwise disjoint subsets such that in the intersection
the associated convex hulls at least one common point in space.

Remarks

  • Tverberg's theorem was preceded by a corresponding conjecture by the English mathematician Bryan John Birch , which he established in a paper presented in 1959.
  • The proposition is optimal in the sense that the proposition of the proposition is no longer valid for subsets with at most spatial points.
  • For one obtains the theorem of radon .

literature

Individual evidence

  1. ^ WA Coppel: Foundations of Convex Geometry. 1998, p. 68 ff.
  2. ^ Mark Longueville: A Course in Topological Combinatorics. 2013, p. 106 ff.
  3. ^ Jiří Matoušek: Lectures on Discrete Geometry. 2002, p. 200 ff.
  4. ^ WA Coppel: Foundations of Convex Geometry. 1998, p. 69.
  5. ^ A b Mark Longueville: A Course in Topological Combinatorics. 2013, p. 106.
  6. ^ Jiří Matoušek: Lectures on Discrete Geometry. 2002, p. 200.
  7. ^ WA Coppel: Foundations of Convex Geometry. 1998, p. 70.