An overview of the computational aspects of nonunique factorization invariants

2015/04/28 by Pedro A. García-Sánchez, García-Sánchez, P. A. · 1 citation
Computer Science · Mathematics · #20M13 #20M14 #Advanced Algebra and Logic #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics #Rings, Modules, and Algebras #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1504.07424

openalex publication_date 2015/04/28 · openalex created_date 2022/10/10 · openalex updated_date 2026/07/28

Abstract

We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.

Cited by

• Buchsbaumness of finite complement simplicial affine semigroups

Related

• A characterization of arithmetical invariants by the monoid of relations
• Factorization in Finitely-Presented Monoids
• Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids
• Some applications of a new approach to factorization
• Factorization Theory in Commutative Monoids