Abstract | ||
---|---|---|
Let G be a (possibly infinite) strongly connected graph and let T be a set of monoid identities such that any monoid satisfying T is also a group. Let 13 be the free groupoid on G satisfying T. Then, the local groups B-v, for v is an element of V(G), are all isomorphic to a free group satisfying T. 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. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1142/S0218196702000961 | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | Field | DocType |
satisfiability | Discrete mathematics,Algebra,Cardinality,Monoid,Isomorphism,Syntactic monoid,Free monoid,Circuit rank,Connectivity,Mathematics,Free group | Journal |
Volume | Issue | ISSN |
12 | 1-2 | 0218-1967 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alair Pereira Do Lago | 1 | 106 | 10.10 |