SearcharxivSearch

arXiv subjects

Eva Foster

Publications and source records attributed to Eva Foster.

2 recordsLinked to original sources

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 $\varphi: \Sigma^+ \to \Sigma^+$, where $\Sigma$ is any alphabet, can be nontrivially expressed as a composition $\varphi = \psi_2 \circ \psi_1$ of endomorphisms $\psi_1, \psi_2: \Sigma^+ \to \Sigma^+$. 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.

cs.FL

Mapped Exponent and Asymptotic Critical Exponent of Words

We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and asymptotic critical exponents of infinite words. We characterize finite words that, when mapped by injective morphisms, can have arbitrarily high fractional exponent. For infinite words, alongside other results, we show that the asymptotic critical exponent grows at most by a constant factor (depending on the size of the alphabet) when mapped by an injective morphism. For both finite and infinite words, the binary case is better understood than the general case.

math.CO