Hansen and Zwick's Fibonacci conjecture for Order-Regular matrices
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 -column Order-Regular matrix, let denote the th Fibonacci number. Hansen and Zwick's Fibonacci conjecture. The maximum number of rows of an -column Order-Regular matrix is given by , the nd Fibonacci number.
Hansen and Zwick proposed this conjecture after exhaustive searches for matrices with up to six columns, whose maximum row counts were . 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
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.