Betti graphs and atomization of Puiseux monoids
Abstract
Let be a Puiseux monoid, that is, a monoid consisting of nonnegative rationals (under addition). A nonzero element of is called an atom if its only decomposition as a sum of two elements in is the trivial decomposition (i.e., one of the summands is ), while a nonzero element is called atomic if it can be expressed as a sum of finitely many atoms allowing repetitions: this formal sum of atoms is called an (additive) factorization of . The monoid is called atomic if every nonzero element of is atomic. In this paper, we study factorizations in atomic Puiseux monoids through the lens of their associated Betti graphs. The Betti graph of is the graph whose vertices are the factorizations of with edges between factorizations that share at least one atom. Betti graphs have been useful in the literature to understand several factorization invariants in the more general class of atomic monoids.
Cite
@article{arxiv.2312.00240,
title = {Betti graphs and atomization of Puiseux monoids},
author = {Scott T. Chapman and Joshua Jang and Jason Mao and Skyler Mao},
journal= {arXiv preprint arXiv:2312.00240},
year = {2023}
}
Comments
14 pages