An overview of the computational aspects of nonunique factorization invariants
Commutative Algebra
2015-04-29 v1 Combinatorics
Abstract
We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.
Keywords
Cite
@article{arxiv.1504.07424,
title = {An overview of the computational aspects of nonunique factorization invariants},
author = {P. A. García-Sánchez},
journal= {arXiv preprint arXiv:1504.07424},
year = {2015}
}