ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let gg and kk be parameters of a (g,k)(g,k)-reverse multiple and let its associated Young graph be the (g,k)(g,k) Young graph. The 1089 graph is the Young graph isomorphic to the (10,4)(10,4) and (10,9)(10,9) Young graphs.

1089 graph conjecture. The (g,k)(g,k) Young graph is isomorphic to the 1089 graph if and only if k+1k+1 divides gg.

The conjecture would explain the many occurrences of the 1089 graph in the computed examples; it is known when k=g−1k=g-1, but the general case remains open.

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.