Extremal factorization lengths of elements in commutative, cancellative semigroups
Baian Liu

TL;DR
This paper characterizes when extremal factorization length properties hold in general commutative, cancellative semigroups, extending known results from numerical semigroups and connecting to geometric objects called Kunz polytopes.
Contribution
It provides necessary and sufficient conditions for extremal factorization length phenomena and generalizes Kunz concepts to broader semigroup classes.
Findings
Characterization of when $L(s+m) = L(s) + 1$ for all $s$
Characterization of when $ ext{ell}(s+m) = ext{ell}(s) + 1$ for all $s$
Identification of Kunz polytope points corresponding to these properties
Abstract
For a numerical semigroup with minimal generators , Barron, O'Neill, and Pelayo showed that and for all sufficiently large , where and are the longest and shortest factorization lengths of , respectively. For some numerical semigroups, for all or for all . In a general commutative, cancellative semigroup , it is also possible to have for some atom and all or to have for some atom and all . We determine necessary and sufficient conditions for these two phenomena. We then generalize the notions of Kunz posets and Kunz polytopes. Each integer point on a Kunz polytope corresponds to a commutative,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Rings, Modules, and Algebras · Algebraic structures and combinatorial models
