The negative-alphabet maximal-orbit conjecture for C_-1,n
Statement
Let be an even integer, possibly nonpositive, and let . Set
Let be either the sequence or the sequence ; both have length . The map is defined using the extension of to distinct integer values of and finite sequences with entries in . Negative-alphabet maximal-orbit conjecture. The orbit of either such sequence under has length . This generalizes the positive-alphabet maximal-orbit conjecture to the case .
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.