Approximating length-based invariants in atomic Puiseux monoids
From MaRDI portal
Publication:5091807
Abstract: A numerical monoid is a cofinite additive submonoid of the nonnegative integers, while a Puiseux monoid is an additive submonoid of the nonnegative cone of the rational numbers. Using that a Puiseux monoid is an increasing union of copies of numerical monoids, we prove that some of the factorization invariants of these two classes of monoids are related through a limiting process. This allows us to extend results from numerical to Puiseux monoids. We illustrate the versatility of this technique by recovering various known results about Puiseux monoids.
Recommendations
Cites work
- scientific article; zbMATH DE number 7334432 (Why is no real title available?)
- An Overview of the Computational Aspects of Nonunique Factorization Invariants
- Atomicity and boundedness of monotone Puiseux monoids
- Delta sets of numerical monoids are eventually periodic.
- Elasticity of factorization in number fields
- Factorization in Dedekind domains with finite class group
- Factorization invariants of Puiseux monoids generated by geometric sequences
- Factorization theory in commutative monoids
- Full elasticity in atomic monoids and integral domains.
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- Numerical semigroups on compound sequences
- Numerical semigroups.
- ON DELTA SETS OF NUMERICAL MONOIDS
- On dynamic algorithms for factorization invariants in numerical monoids
- On the atomic structure of Puiseux monoids
- On the local \(k\)-elasticities of Puiseux monoids
- Puiseux monoids and transfer homomorphisms
- Sets of lengths
- Systems of sets of lengths of Puiseux monoids
- When is a Puiseux monoid atomic?
- numericalsgps, a GAP package for numerical semigroups
Cited in
(5)
This page was built for publication: Approximating length-based invariants in atomic Puiseux monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091807)