Bukh–Matoušek–Nivasch conjecture on simplicial depth

From papers

For a finite set PP of nn points in Rd\mathbb{R}^d, define its simplicial depth as the maximum number of dd-simplices spanned by PP that contain a common point. Bukh–Matoušek–Nivasch conjecture. The simplicial depth of PP is at least (nd+1)d+1\left(\left\lceil\frac{n}{d+1}\right\rceil\right)^{d+1}. The source describes this as a long-standing problem and gives partial bounds in several dimensions.

Progress summary

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

Sources & referencesView supporting material

Primary source

Jesus A. De Loera, Xavier Goaoc, Frédéric Meunier and Nabil Mustafa, “The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg”, arXiv:1706.05975 (2018).

Solutions 0

No solutions have been posted yet.