ON THE BURNSIDE SEMIGROUPS xn = xn+m
In this paper we prove that the congruence classes of A* associated to the Burnside semigroup with |A| generators defined by the equation xn=xn+m, for n≥4 and m≥1, are recognizable. This problem was originally formulated by Brzozowski in 1969 for m=1 and n≥2. De Luca and Varricchio solved the problem for n≥5 in 90. A little later, McCammond extended the problem for m≥1 and solved it independently in the cases n≥6 and m≥1. Our work, which is based on the techniques developed by de Luca and Varricchio, extends both these results. We effectively construct a minimal generator Σ of our congruence. We introduce an elementary concept, namely the stability of productions, which allows to eliminate all hypothesis related to the values of n and m. A substantial part of our proof consists of showing that all productions in Σ are stable, for n≥4 and m≥1. We also show that Σ is a Church-Rosser rewriting system, thus solving the word problem, and show that the semigroup is finite [Formula: see text]-above. We prove that the frame of the ℛ-classes of the semigroup is a tree. We characterize and calculate the ℛ-classes, ℋ-classes and the [Formula: see text]-classes of the semigroup, regular or not, and prove that its maximal subgroups are cyclic of order m whenever all productions of Σ are stable. Recently Guba extended the cases in which the conjecture holds to n≥3 and m≥1. Using his work we obtain the stability of the productions of Σ for n=3 and m≥1 too and, hence, all properties about the semigroup structure hold in this case.