Factorization in monoids and rings
Salvatore Tringali

TL;DR
This paper explores the structure of certain monoids and rings, focusing on factorization properties, and extends known results from commutative, unit-cancellative cases to more general classes like acyclic and locally finitely generated monoids.
Contribution
It generalizes key factorization results from unit-cancellative commutative monoids to acyclic and locally finitely generated monoids, broadening the understanding of their algebraic structure.
Findings
Every non-unit in an atomic l.f.g.u. monoid has finitely many minimal, non-equivalent factorizations.
Acyclic l.f.g.u. monoids are atomic.
In commutative acyclic l.f.g.u. monoids, elements have finitely many non-equivalent factorizations.
Abstract
Let be the group of units of a multiplicatively written monoid . We say is acyclic if for all with or ; unit-cancellative if for all with ; f.g.u. if there is a finite set such that every non-unit of is a finite product of elements of the form with and ; l.f.g.u. if, for each , the smallest divisor-closed submonoid of containing is f.g.u; and atomic if every non-unit can be written as a finite product of atoms, where an atom is a non-unit that does not factor into a product of two non-units. We generalize to l.f.g.u. or acyclic l.f.g.u. monoids a few results so far only known for unit-cancellative l.f.g.u. commutative monoids (cancellative monoids are unit-cancellative, and a…
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 · Finite Group Theory Research
