Linear-bound multiset reconstruction conjecture for tableau minors
Let and let , where . Here denotes the multiset of -minors of the standard Young tableau . Multiset reconstruction conjecture. The multiset determines . This proposed linear bound is supported by computer verification for , and concerns reconstructibility from multisets of -minors.
References
- William Q. Erickson, Daniel Herden, Jonathan Meddaugh, Mark R. Sepanski, Cordell Hammon, Jasmin Mohn and Indalecio Ruiz-Bolanos, “Young tableau reconstruction via minors”, arXiv:2307.13161 (2023).
Progress summary
A reader-submitted construction claims the conjecture is false, but that counterexample has not been independently checked.
The 2023 paper proposed that multisets of -minors reconstruct every standard Young tableau once , reporting computer verification through . The conjecture remains unproved in the public literature.
Known results
- For , every tableau with at least entries is reconstructible from its set of -minors (2021).
- For , set reconstruction holds for , with failure at .
- For multisets, computation gives reconstruction for at , failure at , and only a cubic general sufficient bound is published.
- The conjecture has been computationally verified for .
November 7, 2026 community counterexample
A submitted argument claims two hook tableaux of size have identical multisets of -minors, refuting the claim at . It further claims an ordinary proof of failures with for , implying no constant additive bound; these assertions are unverified.
Current status (as of November 2026): Known special cases and computational checks remain valid, while the general conjecture is unsettled because the submitted counterexample has not been independently verified.
Solutions 1
Two hook tableaux of size 12 with equal multisets of 8-minors: the k+4 reconstruction conjecture failsSee full solution
Result and scope. Erickson-Herden-Meddaugh-Sepanski-Hammon-Mohn-Ruiz-Bolanos (arXiv:2307.13161; J. Combin. Theory Ser. A 209 (2025) 105950), Conjecture conj:k+4: for n >= k+4 the multiset mM_k(T) of k-minors (over all jeu de taquin deletion sequences) determines a standard Young tableau. False at k = 8, n = 12. The hooks T1 (first row 1 5 7 8 12) and T2 (first row 1 2 3 7 10 11) are distinct and have identical mM_8 (19,958,400 minors each). Supplementary (ordinary mathematics, not Lean): a hook weight formula shows that no bound n >= k + c works for any constant c, with an explicit n = k+5 failure at k = 11.
Complete proof: Two hook tableaux of size 12 with equal multisets of 8-minors: the k+4 reconstruction conjecture fails · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.