相关论文: Betti graphs and atomization of Puiseux monoids

Let $M$ be a cancellative and commutative monoid (written additively). The monoid $M$ is atomic if every non-invertible element can be written as a sum of irreducible elements (often called atoms in the literature). Weaker versions of…

In algebra, atomicity is the study of divisibility by and factorizations into atoms (also called irreducibles). In one side of the spectrum of atomicity we find the antimatter algebraic structures, inside which there are no atoms and,…

Let $H^\times$ be the group of units of a multiplicatively written monoid $H$. We say $H$ is acyclic if $xyz \ne y$ for all $x, y, z \in H$ with $x \notin H^\times$ or $z \notin H^\times$; unit-cancellative if $yx \ne x \ne xy$ for all $x,…

A numerical monoid is a cofinite additive submonoid of the nonnegative integers, while a Puiseux monoid is an additive submonoid of the nonnegative cone of the rational numbers. Using that a Puiseux monoid is an increasing union of copies…

We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups.…

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

An atomic monoid $M$ is called a length-factorial monoid (or an other-half-factorial monoid) if for each non-invertible element $x \in M$ no two distinct factorizations of $x$ have the same length. The notion of length-factoriality was…

The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…

Let $M$ be a cancellative and commutative (additive) monoid. The monoid $M$ is atomic if every non-invertible element can be written as a sum of irreducible elements, which are also called atoms. Also, $M$ satisfies the ascending chain…

Several papers in the recent literature have studied factorization properties of affine monoids using the monoid's Betti elements. In this paper, we extend this study to more general rings and monoids. We open by demonstrating the issues…

In classical factorization theory, an integral domain is called \emph{atomic} if every nonzero nonunit element can be written as a finite product of irreducible elements. Here, we introduce and study a weaker notion of atomicity, which…

We study some of the factorization invariants of the class of Puiseux monoids generated by geometric sequences, and we compare and contrast them with the known results for numerical monoids generated by arithmetic sequences. The class we…

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

Let $H$ be a multiplicatively written monoid with identity $1_H$ (in particular, a group). We denote by $\mathcal P_{\rm fin,\times}(H)$ the monoid obtained by endowing the collection of all finite subsets of $H$ containing a unit with the…

Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…

In this paper, we study the atomic structure of Puiseux monoids generated by monotone sequences. To understand this atomic structure, it is often useful to know whether the monoid has a bounded generating set. We provide necessary and…

Given a join semilattice $S$ with a minimum $\hat{0}$, the quarks (also called atoms in order theory) are the elements that cover $\hat{0}$, and for each $x \in S \setminus \{\hat{0}\}$ a factorization (into quarks) of $x$ is a minimal set…

The atom graph of a graph is the graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient…

An integral domain is atomic if every nonzero nonunit factors into irreducibles. Let $R$ be an integral domain. We say that $R$ is a bounded factorization domain if it is atomic and for every nonzero nonunit $x \in R$, there is a positive…

Let $M$ be a cancellative and commutative monoid. A submonoid $N$ of $M$ is called an undermonoid if the Grothendieck groups of $M$ and $N$ coincide. For a given property $\mathfrak{p}$, we are interested in providing an answer to the…