Approximating length-based invariants in atomic Puiseux monoids

zbMATH Open1496.20103arXiv2007.09406MaRDI QIDQ5091807FDOQ5091807

Authors: Harold Polo 

Publication date: 27 July 2022

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.

Full work available at URL: https://arxiv.org/abs/2007.09406

Recommendations

• On the atomic structure of Puiseux monoids
• Factorization invariants of Puiseux monoids generated by geometric sequences
• When is a Puiseux monoid atomic?
• On the molecules of numerical semigroups, Puiseux monoids, and Puiseux algebras
• Systems of sets of lengths of Puiseux monoids

zbMATH Keywords

approximationelasticityset of distancessets of lengthsnumerical monoidsatomic Puiseux monoidsfactorization invariants

Mathematics Subject Classification ID

Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Commutative semigroups (20M14) Arithmetic theory of semigroups (20M13)

Cites Work

• numericalsgps, a GAP package for numerical semigroups
• Non-unique factorizations. Algebraic, combinatorial and analytic theory
• Numerical semigroups.
• ON DELTA SETS OF NUMERICAL MONOIDS
• Factorization in Dedekind domains with finite class group
• Full elasticity in atomic monoids and integral domains.
• Delta sets of numerical monoids are eventually periodic.
• On the local \(k\)-elasticities of Puiseux monoids
• Factorization theory in commutative monoids
• Sets of lengths
• On dynamic algorithms for factorization invariants in numerical monoids
• Elasticity of factorization in number fields
• On the atomic structure of Puiseux monoids
• Atomicity and boundedness of monotone Puiseux monoids
• An Overview of the Computational Aspects of Nonunique Factorization Invariants
• Systems of sets of lengths of Puiseux monoids
• Puiseux monoids and transfer homomorphisms
• Numerical semigroups on compound sequences
• Factorization invariants of Puiseux monoids generated by geometric sequences
• When is a Puiseux monoid atomic?
• Title not available (Why is that?)

Cited In (5)

• Factorization invariants of Puiseux monoids generated by geometric sequences
• On the atomic structure of Puiseux monoids
• About applications of distances on monoids of strings
• On the set of molecules of numerical and Puiseux monoids
• Systems of sets of lengths of Puiseux monoids

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)