vix.ing · top · new · best · stats · spec

Irreducibility of Endomorphisms of Finitely Generated Free Semigroups

2026/03/16 by Paul C. Bell, Eva Foster, Daniel Reidenbach · 1 voice
Computer Science · #cs.FL

paper · pdf

Abstract

We introduce and investigate the irreducibility of endomorphisms of finitely generated free semigroups, i.e., we investigate when an endomorphism φ: Σ+ → Σ+, where Σ is any alphabet, can be nontrivially expressed as a composition φ= ψ2 ∘ ψ1 of endomorphisms ψ1, ψ2: Σ+ → Σ+. 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.

Discussions

Related