pith. sign in

arxiv: 1504.07424 · v1 · pith:VREHCXCHnew · submitted 2015-04-28 · 🧮 math.AC · math.CO

An overview of the computational aspects of nonunique factorization invariants

classification 🧮 math.AC math.CO
keywords factorizationinvariantsnonuniqueoverviewalgorithmsaspectscomputationalcompute
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.