The contiguous-path conjecture for translation sequences

Let FNF_N be the new facet in a translation sequence of a polytope, and let x,yx,y be the vertices defining the paths under consideration. Contiguous-path conjecture. Every edge adjacent to the new facet FNF_N in a translation sequence is a member of some shortest path from xx to yy. The source presents this as a sufficient statement for proving the dd-step conjecture and says that the property is not generally known.

Sources & referencesView supporting material

Primary source

Sandeep Koranne and Anand Kulkarni, “Combinatorial Polytope Enumeration”, arXiv:0908.1619 (2009).

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.