The even-by-even hook Conway-pair conjecture

A partition is a Young diagram, and its Conway pair is the pair of game-theoretic invariants used in the Conway–Gurvich–Ho classification. An even-by-even hook is a hook with an even number of rows and an even number of columns. Even-by-even hook conjecture. A partition λ\lambda has Conway pair (0,1)(0,1) if and only if λ\lambda is an even-by-even hook. Conway pairs (0,1)(0,1) and (1,0)(1,0) play an important role in the classification scheme; the source leaves this characterization as a conjecture.

Sources & referencesView supporting material

Primary source

Ina Bašić, Eric Gottlieb and Matjaž Krnc, “CRIM: A Natural Game on Integer Partitions”, arXiv:2606.16828 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.