Enumeration of m-Endomorphisms
Abstract
An m-endomorphism of a free semigroup is an endomorphism that sends every generator to a word of length at most m. Two m-endomorphisms are combinatorially equivalent if they are conjugate under an automorphism of the semigroup. In this paper, we specialize an argument of N. G. de Bruijn to produce a formula for the number of combinatorial equivalence classes of m-endomorphisms on a rank-n semigroup. From this formula, we derive several little-known integer sequences.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.