Hansen and Zwick's Fibonacci conjecture for Order-Regular matrices

Let an Order-Regular matrix be a binary matrix satisfying the Order-Regularity constraints arising from Policy Iteration on cube acyclic Unique Sink Orientations. For an nn-column Order-Regular matrix, let FkF_k denote the kkth Fibonacci number. Hansen and Zwick's Fibonacci conjecture. The maximum number of rows of an nn-column Order-Regular matrix is given by Fn+2F_{n+2}, the (n+2)(n+2)nd Fibonacci number.

Hansen and Zwick proposed this conjecture after exhaustive searches for matrices with up to six columns, whose maximum row counts were 2,3,5,8,13,212,3,5,8,13,21. The paper disproves the conjecture by constructing Order-Regular matrices exceeding the corresponding Fibonacci bounds.

Sources & referencesView supporting material

Primary source

Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne and Raphaël M. Jungers, “A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations”, arXiv:1407.4293 (2015).

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.