The balanced linkless-embeddability conjecture

Let KK be a dd-dimensional balanced simplicial complex, and let << be a (3,,3)(3,\ldots,3)-admissible order. Let Kb,<K^{b,<} denote the corresponding balanced shift. Balanced linkless-embeddability conjecture. If KK is linklessly embeddable in R2d+1\mathbb{R}^{2d+1}, then Kb,<K^{b,<} does not contain [4](d+1)[4]^{*(d+1)}. This generalizes the graph case motivated by the non-linkless embeddability of [4](d+1)[4]^{*(d+1)} in R2d+1\mathbb{R}^{2d+1}.

Sources & referencesView supporting material

Primary source

Gil Kalai, Eran Nevo and Isabella Novik, “Bipartite Rigidity”, arXiv:1312.0209 (2014).

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.