AI & Computingarticle2026-08-24

Irreducibility of Endomorphisms of Finitely Generated Free Semigroups

Open access0 citations

Abstract

We introduce and investigate the irreducibility of endomorphisms of finitely generated free semigroups, i.e., we investigate when an endomorphism $φ: Σ^+ \to Σ^+$, where $Σ$ is any alphabet, can be nontrivially expressed as a composition $φ= ψ_2 \circ ψ_1$ of endomorphisms $ψ_1, ψ_2: Σ^+ \to Σ^+$. We, hence, study a notion of primality in the endomorphism monoid of the free semigroup -- a natural and fundamental concept in this algebraic structure. We establish that irreducibility is a nontrivial property for the class of so-called rank-preserving endomorphisms, and we provide a characteristic condition separating the reducible and irreducible endomorphisms. We also characterise when an endomorphism is a factor of another endomorphism, analyse the non-uniqueness of factorisations of a rank-preserving endomorphism into its irreducible components, and investigate the use of incidence matrices to give insights into the (ir-)reducibility of rank-preserving endomorphisms.

// Source

View paper (DOI)Open access versionOpenAlexElectronic Proceedings in Theoretical Computer SciencePublished 2026-08-24

Authors: Paul C. Bell, Eva Foster, Daniel Reidenbach