← All problems

Magic number conjecture for the m=2 amplituhedron

For all admissible integers nn and kk with 0≤k≤n−20\le k\le n-2, every tiling T\mathcal{T} of the amplituhedron An,k,2\mathcal{A}_{n,k,2} has exactly ∣T∣=(n−2k)\lvert\mathcal{T}\rvert=\binom{n-2}{k} tiles.

References

Source: Mathematische Annalen

Progress summary

Refreshed
Open · solution reported

A 2024 paper claims to prove the conjecture for the first nontrivial case, and the result was later published, but this record does not independently verify the proof.

The magic number conjecture asserts that every tiling of the m=2m=2 amplituhedron has a fixed number of tiles, namely (n−2k)\binom{n-2}{k}. Parisi, Sherman-Bennett, Tessler, and Williams give a proof via positroid tilings of the hypersimplex.

April 2024 proof claim; 2026 publication

Submitted April 3, 2024 and revised June 7, 2024, the paper states that every relevant tiling of An,k,2\mathcal{A}_{n,k,2} has exactly Mn,k,2=(n−2k)M_{n,k,2}=\binom{n-2}{k} tiles, with the result appearing as Corollary 5.18. It also proves the corresponding hypersimplex statement and derives Parke–Taylor identities. A 2026 Mathematische Annalen record reports the paper’s publication. The claimed resolution is not independently verified in the retrieved evidence.

Current status (as of October 2026): The m=2m=2 conjecture is claimed proved and has been published, with no remaining open part of the stated problem identified; the proof remains unverified in this report.

Sources

Solutions 0

No solutions have been posted yet.