Graph of groups

Graph of groups

In geometric group theory, a graph of groups is an object consisting of a collection of groups indexed by the vertices and edges of a graph, together with a family of injective homomorphisms of the edge groups into the vertex groups.There is a single group, called the fundamental group, canonically associated to each finite connected graph of groups. It admits an orientation-preserving action on a tree: the original graph of groups can be recovered from the quotient graph and the stabiliser subgroups. This theory, commonly referred to as Bass–Serre theory, is due to Bass and Serre.

Definition

A graph of groups over a graph Y is an assignment of a group G_x to each vertex x and a group G_y to each edge y of Y, as well as injective homomorphisms varphi_{y,0} and varphi_{y,1} for each y mapping G_y to the group at each of its endpoints.

Fundamental group

Let "T" be a spanning tree for "Y" and define the fundamental group "Γ" to be the group generated by the vertex groups G_x and elements "y" for each edge subject to the following conditions:

*overline{y} = y^{-1} if overline{y} is the edge y with the reverse orientation.
* y varphi_{y,0}(x) y^{-1} = varphi_{y,1}(x).
*y=1 if y is an edge in "T".

This definition is independent of the choice of "T".

The benefit in defining the fundamental groupoid of a graph of groups, as shown in the paper of Higgins referred to below, is that it is defined independently of base point or tree. Also there is proved there a nice normal form for the elements of the fundamental groupoid. This includes normal form theorems for a free product with amalgamation and for an HNN extension.H. Bass, "Covering theory for graphs of groups." Journal of Pure and Applied Algebra, vol. 89 (1993), no. 1–2, pp. 3–47]

tructure theorem

Let "Γ" be the fundamental group corresponding to the spanning tree "T". For every vertex "x" and edge "y", "G""x" and "G""y" can be identified with their images in "Γ". It is possible to define a graph with vertices and edges the disjoint union of all coset spaces "Γ"/"G""x" and "Γ"/"G""y" respectively. This graph is a tree, called the universal covering tree, on which "Γ" acts. It admits the graph "Y" as fundamental domain. The graph of groups given by the stabiliser subgroups on the fundamental domain corresponds to the original graph of groups.

Examples

*A graph of groups on a graph with one edge and two vertices corresponds to a free product with amalgamation.
*A graph of groups on a single vertex with a loop corresponds to an HNN extension.

Generalisations

The simplest possible generalisation of a graph of groups is a 2-dimensional complex of groups. These are modeled on orbifolds arising from cocompact properly discontinuous actions of discrete groups on 2-dimensional simplicial complexes that have the structure of CAT(0) spaces. The quotient of the simplicial complex has finite stabiliser groups attached to vertices, edges and triangles together with monomorphisms for every inclusion of simplices. A complex of groups is said to be developable if it arises as the quotient of a CAT(0) simplicial complex. Developability is a non-positive curvature condition on the complex of groups: it can be verified locally by checking that all circuits occurring in the links of vertices have length at least six. Such complexes of groups originally arose in the theory of 2-dimensional Bruhat-Tits buildings; their general definition and continued study have been inspired by the ideas of Gromov.

See also

* Free product
* HNN extension
* Right-angled Artin groups
* Bass-Serre theory

References

* Serre, Jean-Pierre, "Trees", Springer (2003) ISBN 3-540-44237-5 (English translation of "arbres, amalgames, SL2", written with the collaboration of Hyman Bass, 3rd edition, "astérisque" 46 (1983)). See Chapter I.5.
* Haefliger, André, "Orbi-espaces," (Orbispaces) in Sur les groupes hyperboliques d'après Mikhael Gromov (Bern, 1988), 203–213, Progr. Math., 83, Birkhäuser (1990). ISBN 0-8176-3508-4
* Higgins, P.J., "The fundamental groupoid of a graph of groups", J. London Math. Soc. (2) 13 (1976) 145–149.
* Bridson, Martin R.; Haefliger, André, "Metric spaces of non-positive curvature". Grundlehren der Mathematischen Wissenschaften, 319. Springer-Verlag, Berlin, 1999. xxii+643 pp. ISBN 3-540-64324-9 MathSciNet|id=1744486
* Dicks, Warren; Dunwoody, Martin J. "Groups acting on graphs". Cambridge Studies in Advanced Mathematics, 17. CUP, Cambridge, 1989. xvi+283 pp. ISBN 0-521-23033-0 MathSciNet|id=1001965


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Graph paper — Regular graphing paper (upper); Logarithmic graphing paper (lower). Graph paper, graphing paper, grid paper or millimeter paper is writing paper that is printed with fine lines making up a …   Wikipedia

  • Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …   Wikipedia

  • Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

  • Stallings theorem about ends of groups — In the mathematical subject of group theory, the Stallings theorem about ends of groups states that a finitely generated group G has more than one end if and only if the group G admits a nontrivial decomposition as an amalgamated free product or… …   Wikipedia

  • Cycle graph (algebra) — For other uses, see Cycle graph (disambiguation). In group theory, a sub field of abstract algebra, a group cycle graph illustrates the various cycles of a group and is particularly useful in visualizing the structure of small finite groups. For… …   Wikipedia

  • List of finite simple groups — In mathematics, the classification of finite simple groups states thatevery finite simple group is cyclic, or alternating, or in one of 16 families of groups of Lie type (including the Tits group, which strictly speaking is not of Lie type),or… …   Wikipedia

  • Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… …   Wikipedia

  • Distance-transitive graph — The Biggs Smith graph, the largest 3 regular distance transitive graph. Graph families defined by their automorphisms distance transitive …   Wikipedia

  • Examples of groups — Some elementary examples of groups in mathematics are given on Group (mathematics). Further examples are listed here. Contents 1 Permutations of a set of three elements 2 The group of translations of the plane 3 The symme …   Wikipedia

  • Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”