Parity conjecture for the number of square rectangulations
Statement
Let denote the total number of rectangulations of a square with tiles, and write for a positive integer. Parity conjecture.
if or ; otherwise,
This conjecture is motivated by the computed sequence of total rectangulation counts and was stated as unproved in the source, which gives partial results concerning symmetry.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.