The catenary and tame degree in finitely generated commutative cancellative monoids.
Publication:2501125
DOI10.1007/S00229-006-0008-8zbMath1117.20045OpenAlexW2111674339WikidataQ58842836 ScholiaQ58842836MaRDI QIDQ2501125
Vadim Ponomarenko, Pedro A. García Sánchez, Scott Thomas Chapman, José Carlos Rosales, David Llena
Publication date: 4 September 2006
Published in: Manuscripta Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00229-006-0008-8
algorithmsfactorizationscommutative cancellative monoidstame degreesminimal presentationscatenary degreesfinitely generated monoids
Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Divisibility and factorizations in commutative rings (13A05)
Related Items (45)
Uses Software
Cites Work
- Chains of factorizations and sets of lengths
- Factorization in finitely generated domains.
- On Diophantine monoids and their class groups.
- Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
- Chains of factorizations in orders of global fields
- ON DELTA SETS OF NUMERICAL MONOIDS
- ON PRESENTATIONS OF COMMUTATIVE MONOIDS
- Computing the elasticity of a Krull monoid
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The catenary and tame degree in finitely generated commutative cancellative monoids.