Affiliation:
1. Instituto de Matematica e Estatistica, Universidade de Sao Paulo, Rua do Matao, 1010, 05508-090 Sao Paulo, Brazil
Abstract
Let G be a (possibly infinite) strongly connected graph and let [Formula: see text] be a set of monoid identities such that any monoid satisfying [Formula: see text] is also a group. Let ℬ be the free groupoid on G satisfying [Formula: see text]. Then, the local groups ℬv, for v ∈ V (G), are all isomorphic to a free group satisfying [Formula: see text]. Furthermore, it is free over a generating set which can be effectively characterized and whose cardinality is the cyclomatic number of the graph G. We also show applications that establish an important connection between free Burnside groups and free Burnside semigroups.
Publisher
World Scientific Pub Co Pte Lt