Minimum universal inventories of MacMahon cubes

A MacMahon cube has six differently coloured faces. An inventory is universal if eight cubes from it can form a larger cube matching the exterior colours of any target variety. Which universal inventories use the fewest cubes?

Why it matters and what counts as progress

Why it matters: Proper rotations give thirty distinct varieties. One small inventory can realize all of them, and classifying those inventories explains the limits of that reuse.

What counts as progress: Prove a minimum size and classify the inventories attaining it. Specify whether cube varieties may repeat, whether colours are labelled and whether internal faces must match.

How the problem developed

  1. 2016 · A minimum inventory of twelve [1]

    Kazuya Haraguchi Kazuya Haraguchi proved that twelve cubes are necessary and sufficient.

  2. 2024 · A conjectured classification [2]

    Inga Johnson and Erika Roldán Inga Johnson and Erika Roldán conjectured that the ten two-triangle inventories in Conway’s tableau exhaust the minimum sets.

  3. 1 Nov 2026 · Classification allowing repeats [3]

    Jason Davies with AI assistance Jason Davies’s project proves the classification even with repeated varieties allowed. It credits GPT-6-Astra with the argument.

AI contribution

The ten minimum universal sets of MacMahon cubes

Jason Davies

A universal inventory of MacMahon cubes needs at least twelve cubes. There are exactly ten labelled inventories of size twelve, the two-triangle sets in Conway’s tableau. The classification allows repeated varieties and proves that none occurs in a minimum inventory.

AI involvementAI-led
ImportanceNotable
Technical verificationFormal (Lean)
Human understandingFew
Paper date:

Sources

  1. Haraguchi’s minimum-size result
  2. Johnson and Roldán’s classification conjectures
  3. The ten minimum universal sets of MacMahon cubes
  4. Pinned theorem, provenance and checking record
Publication history