The classification of digraphs of second minimal odd-period orbits
Statement
A second minimal -orbit is an orbit of odd period occupying the second level in the relevant minimal-orbit ordering, and its digraph is the directed graph associated with that orbit. Two digraph types are identified when they are inverses of one another.
Second minimal odd-orbit digraph conjecture. For every integer , the digraph of any second minimal -orbit has one of possible types up to inverses.
The method proving the classification for second minimal -orbits extends to show that second minimal -, -, and -orbits have respectively , , and possible types up to inverses. The conjecture predicts the general count for all odd periods at least .
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.