ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A second minimal (2k+1)(2k+1)-orbit is an orbit of odd period 2k+12k+1 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 k≥3k\geq 3, the digraph of any second minimal (2k+1)(2k+1)-orbit has one of 4k−34k-3 possible types up to inverses.

The method proving the classification for second minimal 77-orbits extends to show that second minimal 99-, 1111-, and 1313-orbits have respectively 1313, 1717, and 2121 possible types up to inverses. The conjecture predicts the general count for all odd periods at least 77.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.