Length-Factoriality and Pure Irreducibility
Alan Bu, Joseph Vulakh, Alex Zhao

TL;DR
This paper investigates length-factoriality in commutative, cancellative monoids, exploring its properties, related concepts like PLS and bi-length-factoriality, and extending the notion beyond atomic monoids.
Contribution
It generalizes the concept of length-factoriality to broader monoid classes and examines related factorization properties in semirings.
Findings
Length-factoriality characterized in commutative, cancellative monoids.
Connections established between length-factoriality, PLS property, and bi-length-factoriality.
Extended the study of length-factoriality to semirings and non-atomic monoids.
Abstract
An atomic monoid is called length-factorial if for every non-invertible element , no two distinct factorizations of into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The notion of length-factoriality was introduced by J. Coykendall and W. Smith in 2011 under the term 'other-half-factoriality': they used length-factoriality to provide a characterization of unique factorization domains. In this paper, we study length-factoriality in the more general context of commutative, cancellative monoids. In addition, we study factorization properties related to length-factoriality, namely, the PLS property (recently introduced by Chapman et al.) and bi-length-factoriality in the context of semirings.
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
TopicsRings, Modules, and Algebras · semigroups and automata theory
