most citedEliminating Higher-Multiplicity Intersections, I. A Whitney Trick for Tverberg-Type Problems

29 citations · 39 across the 3 of their papers we have counts for

collaborators
Showing math.GTShow all

3 papers · 1 filter

math.GT2016

Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the -Metastable Range

Isaac Mabillard, Uli Wagner

Motivated by Tverberg-type problems in topological combinatorics and by classical results about embeddings (maps without double points), we study the question whether a finite simp…

math.GT2015★ 10 cited

Eliminating Higher-Multiplicity Intersections, III. Codimension 2

S. Avvakumov, I. Mabillard, A. Skopenkov +1

We study conditions under which a finite simplicial complex can be mapped to without higher-multiplicity intersections. An almost -embedding is a map $f: K\to…

math.GT2015★ 29 cited

Eliminating Higher-Multiplicity Intersections, I. A Whitney Trick for Tverberg-Type Problems

Isaac Mabillard, Uli Wagner

Motivated by topological Tverberg-type problems and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K…