Conjecture on recurrent component cardinalities in sinkless rotor networks
Statement
Let be the bidirected cycle on vertices, and let denote the unique recurrent component of level and weight . Write for the number of recurrent configurations in this component.
Recurrent-component cardinality conjecture. For , , and , one has
whenever
The conjecture refines the observed near equality of recurrent-component sizes in sinkless rotor networks on bidirected cycles. It is supported by data for small values of and , but the supplied source does not state a 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.