Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-16T12:08:21.582Z Has data issue: false hasContentIssue false
  • English
  • Français

The topology of graph products of groups

Published online by Cambridge University Press:  20 January 2009

John Meier
John Meier
Affiliation:
Department of Mathematics, Lafayette College, Easton, PA 18042, U.S.A.meierj@lafvax.lafayette.edu
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.

Given a finite (connected) simplicial graph with groups assigned to the vertices, the graph product of the vertex groups is the free product modulo the relation that adjacent groups commute. The graph product of finitely presented infinite groups is both semistable at infinity and quasi-simply filtrated. Explicit bounds for the isoperimetric inequality and isodiametric inequality for graph products is given, based on isoperimetric and isodiametric inequalities for the vertex groups.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 37 , Issue 3 , October 1994 , pp. 539 - 544
Copyright
Copyright © Edinburgh Mathematical Society 1994

References

REFERENCES

1.Baik, Y.-G., Howie, J. and Pride, S. J., The identity problem for graph products of groups, J. Algebra 162 (1993), 168–177.CrossRefGoogle Scholar
2.Brick, S. G., On Dehn functions and products of groups, Trans. Amer. Math. Soc. 335 (1993), 369–384.Google Scholar
3.Brick, S. G. and Mihalik, M. L., The QSF property for groups and spaces, preprint.Google Scholar
4.Brick, S. G. and Mihalik, M. L., Group extensions are Quasi-simply-filtrated, preprint.Google Scholar
5.Chiswell, I. M., The Growth Series of a Graph Product, preprint.Google Scholar
6.Cohen, D. E., Isoperimetric functions for graph products, preprint.Google Scholar
7.Gersten, S. M., Dehn functions and l 1-norms of finite presentations, in Algorithms and Classifications in Combinatorial Group Theory (Baumslag, G. and Miller, C. F. III, eds., Math. Sci. Res., Springer-Verlag, 1991).Google Scholar
8.Green, E. R., Graph products of groups, Thesis, University of Leeds, (1990).Google Scholar
9.Hermiller, S. and Meier, J., Algorithms and Geometry for Graph Products of Groups, J. Algebra, to appear.Google Scholar
10.Lyndon, R. C. and Schupp, P. E., Combinatoral group theory (Springer-Verlag, 1977).Google Scholar
11.Mihalik, M., Semistability at the end of group extension, Trans. Amer. Math. Soc. 277 (1983), 307–321.CrossRefGoogle Scholar
12.Mihalik, M. and Tschantz, S., Semistability of Amalgamated Products and HNN-Extensions (Mem. Amer. Math. Soc. 471, 1992).Google Scholar