← All problems

Linear-bound multiset reconstruction conjecture for tableau minors

3 years old · traced to

Let k≥1k\geq 1 and let T∈YT⁡(n)T\in\operatorname{YT}(n), where n≥k+4n\geq k+4. Here mM⁡k(T)\operatorname{mM}_k(T) denotes the multiset of kk-minors of the standard Young tableau TT. Multiset reconstruction conjecture. The multiset mM⁡k(T)\operatorname{mM}_k(T) determines TT. This proposed linear bound is supported by computer verification for k≤5k\leq 5, and concerns reconstructibility from multisets of kk-minors.

References
  1. 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

Refreshed
Open · progress reported

A reader-submitted construction claims the conjecture is false, but that counterexample has not been independently checked.

The 2023 paper proposed that multisets of kk-minors reconstruct every standard Young tableau once n≥k+4n\geq k+4, reporting computer verification through k=5k=5. The conjecture remains unproved in the public literature.

Known results

  • For k=1k=1, every tableau with at least 55 entries is reconstructible from its set of 11-minors (2021).
  • For k=2k=2, set reconstruction holds for n≥8n\geq 8, with failure at n=7n=7.
  • For multisets, computation gives reconstruction for k=2k=2 at n=6,7n=6,7, failure at n=5n=5, and only a cubic general sufficient bound is published.
  • The conjecture has been computationally verified for k≤5k\leq 5.

November 7, 2026 community counterexample

A submitted argument claims two hook tableaux of size 1212 have identical multisets of 88-minors, refuting the n≥k+4n\geq k+4 claim at (k,n)=(8,12)(k,n)=(8,12). It further claims an ordinary proof of failures with n=k+5n=k+5 for k=11k=11, 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.

Sources

Solutions 1

Two hook tableaux of size 12 with equal multisets of 8-minors: the k+4 reconstruction conjecture failsSee full solutionHide 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.