The contiguous-path conjecture for translation sequences
The contiguous-path conjecture for translation sequences
Let be the new facet in a translation sequence of a polytope, and let be the vertices defining the paths under consideration. Contiguous-path conjecture. Every edge adjacent to the new facet in a translation sequence is a member of some shortest path from to . The source presents this as a sufficient statement for proving the -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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.