Irreducibility of Endomorphisms of Finitely Generated Free Semigroups

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.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2026-08-24
DOI
https://doi.org/10.4204/eptcs.451.5
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Irreducibility of Endomorphisms of Finitely Generated Free Semigroups

Daniel Reidenbach, Eva Foster, Paul C. Bell
Electronic Proceedings in Theoretical Computer Science
semigroups and automata theory
article

Irreducibility of Endomorphisms of Finitely Generated Free Semigroups

Daniel Reidenbach, Eva Foster, Paul C. Bell
article en

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.

Electronic Proceedings in Theoretical Computer ScienceVol. 451
Liverpool John Moores University (GB), Birkbeck, University of London (GB)
Reduced inequalities
Openalex Percentile: Top 71%
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.