The eventual special-vertex conjecture for Hanoi border paths

About 10 years old · traced to

Let p≥3p\geq 3, let Gn+1(p)G^{(p)}_{n+1} contain the copy AGn(p)AG^{(p)}_n, and let Sn0S_{n_0} be the recursively defined border set. Let aa be the vertex labeled An0+1A^{n_0+1}, and call a vertex special when its label has the form An−iXiA^{n-i}X^i with X∈Ap∖{A,B}X\in{\cal A}_p\setminus\{A,B\} in the relevant shortest-path setting. Eventual special-vertex conjecture. For any p≥3p\geq 3, there is n0≥2n_0\geq 2 such that for any v∈Sn0v\in S_{n_0} there is a shortest path from aa to vv that meets a special vertex. This is proposed as the inductive base needed for the partial proof of the special-vertex result; the supplied text gives no resolution evidence.

References

Primary source

Janez Žerovnik, “Self Similarities of the Tower of Hanoi Graphs and a proof of the Frame-Stewart Conjecture”, arXiv:1601.04298 (2016).

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.