{"paper":{"title":"Symmetrically Constrained Compositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Carla D. Savage, Ira M. Gessel, Matthias Beck, Sunyoung Lee","submitted_at":"2009-06-30T16:14:29Z","abstract_excerpt":"Given integers $a_1, a_2, ..., a_n$, with $a_1 + a_2 + ... + a_n \\geq 1$, a symmetrically constrained composition $\\lambda_1 + lambda_2 + ... + lambda_n = M$ of $M$ into $n$ nonnegative parts is one that satisfies each of the the $n!$ constraints\n  ${\\sum_{i=1}^n a_i \\lambda_{\\pi(i)} \\geq 0 : \\pi \\in S_n}$. We show how to compute the generating function of these compositions, combining methods from partition theory, permutation statistics, and lattice-point enumeration."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.5573","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"}