相关论文: Length-factoriality in commutative monoids and int…

A semidomain is an additive submonoid of an integral domain that is closed under multiplication and contains the identity element. Although atomicity and divisibility in integral domains have been systematically investigated for more than…

Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…

We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of elements of $A$, and…

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…

We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…

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…

A commutative monoid is atomic if every non-invertible element factors into irreducibles (also called atoms), while an integral (semi)domain is atomic if its multiplicative monoid is atomic. Notions weaker than atomicity have been…

Let $M$ be a cancellative and commutative monoid. A non-invertible element of $M$ is called an atom (or irreducible element) if it cannot be factored into two non-invertible elements, while an atom $a$ of $M$ is called strong if $a^n$ has a…

With the growing evolution of the theory of non-unique factorization in integral domains and monoids, the study of several variations to the classical unique factorization domain (or UFD) property have become popular in the literature.…

In this paper, we study various factorization invariants of arithmetical congruence monoids. The invariants we investigate are the catenary degree, a measure of the maximum distance between any two factorizations of the same element, the…

Let $M$ be a Puiseux monoid, that is, a monoid consisting of nonnegative rationals (under addition). A nonzero element of $M$ is called an atom if its only decomposition as a sum of two elements in $M$ is the trivial decomposition (i.e.,…

The aim of this paper is sketch a theory of divisibility and factorisation in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely…

In this paper, we address various aspects of divisibility by irreducibles in rings consisting of integer-valued polynomials. An integral domain is called atomic if every nonzero nonunit factors into irreducibles. Atomic domains that do not…

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,…

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

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.…

Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the…

Let $\mathbb{N} \mathcal{A}$ be the monoid generated by $\mathcal{A} = {\mathbf{a}_1, ..., \mathbf{a}_n} \subseteq \mathbb{Z}^d.$ We introduce the homogeneous catenary degree of $\mathbb{N} \mathcal{A}$ as the smallest $N \in \mathbb N$…

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

The set $\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ of all finite subsets of $\mathbb{N}_0$ containing the zero element is a monoid with set addition as operation. If a set $A\in\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ can be written in the…