Kotěšovec's Fibonacci-period conjecture for queens
Kotěšovec's Fibonacci-period conjecture for queens
Let be the th Fibonacci number, let , and let be the counting quasipolynomial for queens. Kotěšovec's conjecture. The period of is
the least common multiple of all positive integers up through . Kotěšovec's conjectured periods through agree with this formula, but the general assertion is not proved in the supplied text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Seth Chaiken, Christopher R. H. Hanusa and Thomas Zaslavsky, “A q-Queens Problem. IV. Attacking Configurations and Their Denominators”, arXiv:1807.04741 (2018).
Additional references
2 papers in this index state this conjecture (2016–2018). The statement above is taken from the most recent of them; the others are arXiv:1609.00853.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.