On length densities
Scott T. Chapman, Christopher O'Neill, Vadim Ponomarenko

TL;DR
This paper introduces the concept of length density in commutative cancellative monoids, explores its properties through various examples, and investigates conditions under which certain limits exist or are rational.
Contribution
It defines length density for monoids, relates it to existing invariants, and studies its properties, including examples with irrational values and conditions for rationality and limit existence.
Findings
Length density relates to known factorization invariants.
Finitely generated monoids have rational length density.
The limit of length density for powers may not always exist.
Abstract
For a commutative cancellative monoid , we introduce the notion of the length density of both a nonunit , denoted , and the entire monoid , denoted . This invariant is related to three widely studied invariants in the theory of non-unit factorizations, , , and . We consider some general properties of and and give a wide variety of examples using numerical semigroups, Puiseux monoids, and Krull monoids. While we give an example of a monoid with irrational length density, we show that if is finitely generated, then is rational and there is a nonunit element with (such a monoid is said to have accepted length density). While it is well-known that the much studied asymptotic versions of , and …
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.
