The 1089 graph divisibility conjecture for reverse multiples
Statement
Let and be parameters of a -reverse multiple and let its associated Young graph be the Young graph. The 1089 graph is the Young graph isomorphic to the and Young graphs.
1089 graph conjecture. The Young graph is isomorphic to the 1089 graph if and only if divides .
The conjecture would explain the many occurrences of the 1089 graph in the computed examples; it is known when , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.