{"paper":{"title":"Another proof of the $n!$ conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Geir Ellingsrud, Stein Arild Str{\\o}mme","submitted_at":"2011-08-22T19:32:53Z","abstract_excerpt":"The \"n! conjecture\" of Garsia and Haiman has inspired mathematicians for nearly two decades, even after Haiman published a proof in 2001. Kumar and Funch Thomsen proved in 2003 that in order to prove the conjecture for all partitions, it suffices to prove it for the so-called \"staircase partitions\" $(k,k-1,...,2,1)$ for each $k>1$. In the present paper we give a construction of a specially designed two-dimensional family of length-$n$ subschemes of the plane, and use that to prove the $n!$ conjecture for staircase partitions. Together with the result of Kumar and Funch Thomsen, this provides a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4403","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}