Maximal groups in free Burnside semigroups

DOI10.1007/BFB0054311MaRDI QIDQ3838999zbMATH OpenFDO

Authors Alair Pereira do Lago

Publication date 23 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0054311

zbMATH Keywords

free Burnside groupoidsfree Burnside groupsfree Burnside semigroupsmaximal subgroupsvarieties of semigroups

Mathematics Subject Classification ID

Maximal subgroups (20E28) Periodic groups; locally finite groups (20F50) Groupoids (i.e. small categories in which all morphisms are isomorphisms) (20L05) Free semigroups, generators and relations, word problems (20M05)

Review text

The free Burnside semigroup over a finite set \(A\) is the \(A\)-generated free object in the variety of semigroups satisfying \(x^{n+m}=x^n\) (\(n,m\geq 1\)). The main result of the announcement under review is that any maximal subgroup in the free non-cyclic Burnside semigroup is a free group in the group variety defined by \(x^m=1\). The number of generators of the group is equal to the cyclomatic number of a graph associated to the \(\mathcal J\)-class that contains the group. The author proves in detail that, for \(n=2\) and \(A=\{a,b\}\), the cyclomatic number of the graph associated to the \(\mathcal J\)-class of the element \((babab)^2\) is at least \(2m-1\). Therefore -- and in strong contrast with the case \(n\geq 3\) (see, for example, the author's paper [Int. J. Algebra Comput. 6, No. 2, 179-227 (1996; Zbl 0857.20039)]) -- the corresponding free Burnside semigroup has non-cyclic subgroups and (for sufficiently large \(m\)) contains an infinite subgroup. The latter fact implies that the free 2-generated Burnside semigroup with \(n=2\) and sufficiently large \(m\) is not finite \(\mathcal J\)-above and that the congruence class of \(\{a,b\}^+\) corresponding to an element of this semigroup can be not recognizable by a finite automaton. The main result also contains the results of \textit{J. Ka\u{d}ourek} and \textit{L. Polák} [Simon Stevin 64, No. 1, 3-19 (1990; Zbl 0712.20038)]\ who studied the case \(n=1\). The proof of the announced result is contained in the author's PhD thesis whose English translation is available under \texttt{http://www.ime.usp.br/\(\sim\)alair/Burnside/phd.html}. For the entire collection see [Zbl 0889.00032].

Recommendations

• Free Burnside Semigroups
• FREE SEMIGROUP IN THE GROUP OF AUTOMORPHISMS OF THE FREE BURNSIDE GROUP
• On a conjecture of Brown
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥4 OR m=3, n=1
• On the word problem for the free Burnside semigroups satisfying x^2=x^3.
• scientific article; zbMATH DE number 4171232
• Overlap-free words and the free Burnside semigroup with two generators satisfying the identity \(x^2=x^3\).
• The automorphisms of endomorphism semigroups of free Burnside groups.
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥3
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6

Cited in

(2)

• Free Burnside Semigroups
• scientific article; zbMATH DE number 4171232 (Why is no real title available?)

This page was built for publication: Maximal groups in free Burnside semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838999)