An overview of the computational aspects of nonunique factorization invariants
P. A. Garc\'ia-S\'anchez
TL;DR
This paper reviews algorithms for computing invariants related to nonunique factorizations in finitely generated monoids, highlighting computational approaches and their applications.
Contribution
It provides a comprehensive overview of existing algorithms for calculating nonunique factorization invariants in finitely generated monoids, emphasizing computational methods.
Findings
Summarizes key algorithms for invariant computation
Highlights computational challenges and solutions
Provides insights into applications of these invariants
Abstract
We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · semigroups and automata theory · Advanced Algebra and Logic