Related papers: Factorisation in Topological Monoids
The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…
A homomorphism from a completely metrizable topological group into a free product of groups whose image is not contained in a factor of the free product is shown to be continuous with respect to the discrete topology on the range. In…
We construct an iterative method for factorising small strict n-categories into a unique (up to isomorphism) collection of small 1- categories. Following this we develop the theory to include a large class of $\infty$-categories. We use…
In this note we prove that any affine algebraic monoid can be obtained as the endomorphisms' monoid of a finite-dimensional (nonassociative) algebra.
An integral domain (or a commutative cancellative monoid) is atomic if every nonzero nonunit element is the product of irreducibles, and it satisfies the ACCP if every ascending chain of principal ideals eventually stabilizes. The interplay…
We investigate cases where the finite dual coalgebra of a twisted tensor product of two algebras is a cotwisted tensor product of their respective finite dual coalgebras. This is achieved by interpreting the finite dual as a topological…
A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…
We introduce and investigate the category $\mathsf{AtoMon}$ of atomic monoids and atom-preserving monoid homomorphisms, which is a (non-full) subcategory of the usual category of monoids. In particular, we compute all limits and colimits,…
A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…
We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…
Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…
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,…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…
An atomic monoid is length-factorial if each two distinct factorizations of any element have distinct factorization lengths. We provide a characterization of length-factorial Krull monoids in terms of their class groups and the distribution…
It is known that factorisation systems in categories can be viewed as unitary pseudo algebras for the "squaring" monad in Cat. We show in this note that an analogous fact holds for proper (i.e., epi-mono) factorisation systems and a…
If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…
A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…
A Puiseux monoid is an additive submonoid of the nonnegative rational numbers. If $M$ is a Puiseux monoid, then the question of whether each non-invertible element of $M$ can be written as a sum of irreducible elements (that is, $M$ is…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…