{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EIPTQ2CKLPRLJGPHKDE4PLWYVV","short_pith_number":"pith:EIPTQ2CK","schema_version":"1.0","canonical_sha256":"221f38684a5be2b499e750c9c7aed8ad6c224c61501ee84511f348d5190bcc03","source":{"kind":"arxiv","id":"1108.4403","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1108.4403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-08-22T19:32:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5a23417eea99cf668513ee7442eae83d1c413d1b3cf90484a61109ff14b65cd1","abstract_canon_sha256":"848cc0030bd3558150ec8d9dd765520d819489a5aa7b1758416eb6fb5715acdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:05.231929Z","signature_b64":"Endn72o1UYmWAao5iz7RKGVlP0QzUflIndwxtLXQVi4CGstglQDj6XQwiTZYnuUd606xQ4r+PtflOSvTa3VtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"221f38684a5be2b499e750c9c7aed8ad6c224c61501ee84511f348d5190bcc03","last_reissued_at":"2026-05-18T04:13:05.231395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:05.231395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.4403","created_at":"2026-05-18T04:13:05.231457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4403v2","created_at":"2026-05-18T04:13:05.231457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4403","created_at":"2026-05-18T04:13:05.231457+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIPTQ2CKLPRL","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIPTQ2CKLPRLJGPH","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIPTQ2CK","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV","json":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV.json","graph_json":"https://pith.science/api/pith-number/EIPTQ2CKLPRLJGPHKDE4PLWYVV/graph.json","events_json":"https://pith.science/api/pith-number/EIPTQ2CKLPRLJGPHKDE4PLWYVV/events.json","paper":"https://pith.science/paper/EIPTQ2CK"},"agent_actions":{"view_html":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV","download_json":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV.json","view_paper":"https://pith.science/paper/EIPTQ2CK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4403&json=true","fetch_graph":"https://pith.science/api/pith-number/EIPTQ2CKLPRLJGPHKDE4PLWYVV/graph.json","fetch_events":"https://pith.science/api/pith-number/EIPTQ2CKLPRLJGPHKDE4PLWYVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV/action/storage_attestation","attest_author":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV/action/author_attestation","sign_citation":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV/action/citation_signature","submit_replication":"https://pith.science/pith/EIPTQ2CKLPRLJGPHKDE4PLWYVV/action/replication_record"}},"created_at":"2026-05-18T04:13:05.231457+00:00","updated_at":"2026-05-18T04:13:05.231457+00:00"}