The lcm-maximal piece conjecture for coefficient periods
Statement
For a piece with move set , write
For a positive integer , let be the lcm-maximal piece whose move set consists of all moves satisfying . Lcm-maximal piece conjecture. Among all pieces satisfying
maximizes the period of every coefficient , for fixed .
This conjecture is motivated by the proposed period bounds for and ; the paper gives no proof or general resolution.
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.