The exact formula conjecture for the topological Tverberg threshold

About 11 years old · traced to

Let Nr(d)N_r(d) denote the least integer NN such that every continuous map from the NN-simplex to Rd\mathbb{R}^d identifies points from rr pairwise disjoint faces. The parameters satisfy r≥2r\ge 2 and d≥1d\ge 1.

Exact formula conjecture.

Nr(d)={(r−1)(d+1)if r is a power of a prime or d≤r,r(d+1)−1otherwise.N_r(d)=\begin{cases}(r-1)(d+1)&\text{if }r\text{ is a power of a prime or }d\le r,\\r(d+1)-1&\text{otherwise}.\end{cases}

This predicts the precise threshold governing the failure of the topological Tverberg phenomenon. The supplied text does not provide evidence resolving the conjecture.

References

Primary source

Pavle V. M. Blagojević, Florian Frick and Günter M. Ziegler, “Barycenters of Polytope Skeleta and Counterexamples to the Topological Tverberg Conjecture, via Constraints”, arXiv:1510.07984 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.