Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-22T19:32:02.298Z Has data issue: false hasContentIssue false
  • English
  • Français

Characterizations of Schützenberger graphs in terms of their automorphism groups and fundamental groups

Published online by Cambridge University Press:  18 May 2009

David Cowan  and
Norman R. Reilly
David Cowan
Affiliation:
Department of Mathematics and StatisticsSimon Fraser UniversityBritish ColumbiaCanada
Norman R. Reilly
Affiliation:
Department of Mathematics and StatisticsSimon Fraser UniversityBritish ColumbiaCanada
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The importance of the fundamental group of a graph in group theory has been well known for many years. The recent work of Meakin, Margolis and Stephen has shown how effective graph theoretic techniques can be in the study of word problems in inverse semigroups. Our goal here is to characterize those deterministic inverse word graphs that are Schutzenberger graphs and consider how deterministic inverse word graphs and Schutzenberger graphs can be constructed from subgroups of free groups.

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 35 , Issue 3 , September 1993 , pp. 275 - 291
Copyright
Copyright © Glasgow Mathematical Journal Trust 1993

References

REFERENCES

1.Clifford, A. H. and Preston, G. B., The algebraic theory of semigroups, Vol. 1, Amer. Math. Soc. Surveys, No. 7. 1961.Google Scholar
2.Cohen, D. E., Combinatorial Group Theory: a topological approach, London Math. Soc. Student Texts, Cambridge University Press, Cambridge, U.K.Google Scholar
3.Margolis, S. W. and Meakin, J., E-unitary inverse monoids and the Cayley graph of a group presentation, J. Pure Appl. Algebra 58 (1989), 45–76.CrossRefGoogle Scholar
4.Margolis, S. W. and Meakin, J., Graph immersions and inverse monoids, in Monoids and semigroups with applications, ed. Rhodes, J. (World Scientific, 1991), 144–158.Google Scholar
5.Margolis, S. W. and Meakin, J., Immersions and the free inverse category over a graph (manuscript).Google Scholar
6.Margolis, S. W. and Meakin, J., Free inverse monoids and graph immersions, International J. Algebra and Computation 3 (1993), 79–100.CrossRefGoogle Scholar
7.Margolis, S. W., Meakin, J., Jones, P., Free products of inverse semigroups II Glasgow Math. J. 33 (1991), 373–387.Google Scholar
8.Serre, J.-P., Trees (Springer-Verlag, 1980).CrossRefGoogle Scholar
9.Stephen, J. B., Presentation of inverse monoids, J. Pure Appl. Algebra 63 (1990), 81–112.CrossRefGoogle Scholar