Tverberg plus constraints
By Pavle V. M. Blagojević, Florian Frick, Günter M. Ziegler. 2014
67 citations recorded by the source corpus.
Many of the strengthenings and extensions of the topological Tverberg theorem can be derived with surprising ease directly from the original theorem: For this, we introduce a proof technique that combines a concept of ‘Tverberg unavoidable subcomplexes’ with the observation that Tverberg points that equalize the distance from such a subcomplex can be obtained from maps to an extended target space.
Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Materials Chemistry
View Paper: https://www.semanticscholar.org/paper/02552bd2f1c5ade7aebf7d15ec374cdb4168ea0b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Computer Graphics and Computer-Aided Design
In Materials Chemistry
Citations in the corpus
- Counterexamples to the topological Tverberg conjecture (2015, methodology): “ of the van Kampen–Flores theorem. Counterexamples to the topological Tverberg conjecture are then obtained by an additional application of the constraint method of Blagojevic, Ziegler and the author [2].´ In the conference proceedings version [4] Mabillard and Wagner announcedthe generalized van Ka”
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story (2016, methodology): “ faces of the simplex d+2, which has d+ 3 vertices, so by the pigeonhole principle one of themhasatmostb(d+ 3)=2c= d=2 + 1 vertices. Theproofwehavepresentedisanexampleoftheconstraintmethod developedin[12]. Animportant message of this proof is that the Van Kampen–Flores theorem is a corollary of the ”