Jump to content

Bass–Serre theory

From Wikipedia, the free encyclopedia
(Redirected from Bass-Serre theory)

Bass–Serre theory is a part of the mathematical subject of group theory that deals with analyzing the algebraic structure of groups acting by automorphisms on simplicial trees. The theory relates group actions on trees with decomposing groups as iterated applications of the operations of free product with amalgamation and HNN extension, via the notion of the fundamental group of a graph of groups. Bass–Serre theory can be regarded as one-dimensional version of the orbifold theory.

History

[edit]

Bass–Serre theory was developed by Jean-Pierre Serre in the 1970s and formalized in Trees, Serre's 1977 monograph (developed in collaboration with Hyman Bass) on the subject.[1][2] Serre's original motivation was to understand the structure of certain algebraic groups whose Bruhat–Tits buildings are trees. However, the theory quickly became a standard tool of geometric group theory and geometric topology, particularly the study of 3-manifolds. Subsequent work of Bass[3] contributed substantially to the formalization and development of basic tools of the theory and currently the term "Bass–Serre theory" is widely used to describe the subject.

Mathematically, Bass–Serre theory builds on exploiting and generalizing the properties of two older group-theoretic constructions: free product with amalgamation and HNN extension. However, unlike the traditional algebraic study of these two constructions, Bass–Serre theory uses the geometric language of covering theory and fundamental groups. Graphs of groups, which are the basic objects of Bass–Serre theory, can be viewed as one-dimensional versions of orbifolds.

Apart from Serre's book,[2] the basic treatment of Bass–Serre theory is available in the article of Bass,[3] the article of G. Peter Scott and C. T. C. Wall[4] and the books of Allen Hatcher,[5] Gilbert Baumslag,[6] Warren Dicks and Martin Dunwoody[7] and Daniel E. Cohen.[8]

Basic set-up

[edit]

Graphs in the sense of Serre

[edit]

Serre's formalism of graphs is slightly different from the standard formalism from graph theory. Here a graph A consists of a vertex set V, an edge set E, an edge reversal map such that ee and for every e in E, and an initial vertex map . Thus in A every edge e comes equipped with its formal inverse e. The vertex o(e) is called the origin or the initial vertex of e and the vertex o(e) is called the terminus of e and is denoted t(e). Both loop-edges (that is, edges e such that o(e) = t(e)) and multiple edges are allowed. An orientation on A is a partition of E into the union of two disjoint subsets E+ and E so that for every edge e exactly one of the edges from the pair e, e belongs to E+ and the other belongs to E.

Graphs of groups

[edit]

A graph of groups A consists of the following data:

  • A connected graph A;
  • An assignment of a vertex group Av to every vertex v of A.
  • An assignment of an edge group Ae to every edge e of A so that we have for every e ∈ E.
  • Boundary monomorphisms for all edges e of A, so that each is an injective group homomorphism.

For every the map is also denoted by .

Fundamental group of a graph of groups

[edit]

There are two equivalent definitions of the notion of the fundamental group of a graph of groups: the first is a direct algebraic definition via an explicit group presentation (as a certain iterated application of amalgamated free products and HNN extensions), and the second using the language of groupoids.

The algebraic definition is easier to state:

First, choose a spanning tree T in A. The fundamental group of A with respect to T, denoted π1(A, T), is defined as the quotient of the free product

where F(E) is a free group with free basis E, subject to the following relations:

  • for every e in E and every . (The so-called Bass–Serre relation.)
  • ee = 1 for every e in E.
  • e = 1 for every edge e of the spanning tree T.

There is also a notion of the fundamental group of A with respect to a base-vertex v in V, denoted π1(A, v), which is defined using the formalism of groupoids. It turns out that for every choice of a base-vertex v and every spanning tree T in A the groups π1(A, T) and π1(A, v) are naturally isomorphic.

The fundamental group of a graph of groups has a natural topological interpretation as well: it is the fundamental group of a graph of spaces whose vertex spaces and edge spaces have the fundamental groups of the vertex groups and edge groups, respectively, and whose gluing maps induce the homomorphisms of the edge groups into the vertex groups. One can therefore take this as a third definition of the fundamental group of a graph of groups.

Fundamental groups of graphs of groups as iterations of amalgamated products and HNN-extensions

[edit]

The group G = π1(A, T) defined above admits an algebraic description in terms of iterated amalgamated free products and HNN extensions. First, form a group B as a quotient of the free product

subject to the relations

  • e−1αe(g)e = ωe(g) for every e in E+T and every .
  • e = 1 for every e in E+T.

This presentation can be rewritten as

which shows that B is an iterated amalgamated free product of the vertex groups Av.

Then the group G = π1(A, T) has the presentation

which shows that G = π1(A, T) is a multiple HNN extension of B with stable letters .

Splittings

[edit]

An isomorphism between a group G and the fundamental group of a graph of groups is called a splitting of G. If the edge groups in the splitting come from a particular class of groups (e.g. finite, cyclic, abelian, etc.), the splitting is said to be a splitting over that class. Thus a splitting where all edge groups are finite is called a splitting over finite groups.

Algebraically, a splitting of G with trivial edge groups corresponds to a free product decomposition

where F(X) is a free group with free basis X = E+(AT) consisting of all positively oriented edges (with respect to some orientation on A) in the complement of some spanning tree T of A.

The normal forms theorem

[edit]

Let g be an element of G = π1(A, T) represented as a product of the form

where e1, ..., en is a closed edge-path in A with the vertex sequence v0, v1, ..., vn = v0 (that is v0=o(e1), vn = t(en) and vi = t(ei) = o(ei+1) for 0 < i < n) and where for i = 0, ..., n.

Suppose that g = 1 in G. Then

  • either n = 0 and a0 = 1 in ,
  • or n > 0 and there is some 0 < i < n such that ei+1 = ei and .

The normal forms theorem immediately implies that the canonical homomorphisms Av → π1(A, T) are injective, so that we can think of the vertex groups Av as subgroups of G.

Higgins has given a nice version of the normal form using the fundamental groupoid of a graph of groups.[9] This avoids choosing a base point or tree, and has been exploited by Moore.[10]

Bass–Serre covering trees

[edit]

To every graph of groups A, with a specified choice of a base-vertex, one can associate a Bass–Serre covering tree , which is a tree that comes equipped with a natural group action of the fundamental group π1(A, v) without edge-inversions. Moreover, the quotient graph is isomorphic to A.

Similarly, if G is a group acting on a tree X without edge-inversions (that is, so that for every edge e of X and every g in G we have gee), one can define the natural notion of a quotient graph of groups A. The underlying graph A of A is the quotient graph X/G. The vertex groups of A are isomorphic to vertex stabilizers in G of vertices of X and the edge groups of A are isomorphic to edge stabilizers in G of edges of X.

Moreover, if X was the Bass–Serre covering tree of a graph of groups A and if G = π1(A, v) then the quotient graph of groups for the action of G on X can be chosen to be naturally isomorphic to A.

Fundamental theorem of Bass–Serre theory

[edit]

Let G be a group acting on a tree X without inversions. Let A be the quotient graph of groups and let v be a base-vertex in A. Then G is isomorphic to the group π1(A, v) and there is an equivariant isomorphism between the tree X and the Bass–Serre covering tree . More precisely, there is a group isomorphism σ: G → π1(A, v) and a graph isomorphism such that for every g in G, for every vertex x of X and for every edge e of X we have j(gx) = g j(x) and j(ge) = g j(e).

This result is also known as the structure theorem.[2]

One of the immediate consequences is the classic Kurosh subgroup theorem describing the algebraic structure of subgroups of free products.

Examples

[edit]

Amalgamated free product

[edit]

Consider a graph of groups A consisting of a single non-loop edge e (together with its formal inverse e) with two distinct end-vertices u = o(e) and v = t(e), vertex groups H = Au, K = Av, an edge group C = Ae and the boundary monomorphisms . Then T = A is a spanning tree in A and the fundamental group π1(A, T) is isomorphic to the amalgamated free product

In this case the Bass–Serre tree can be described as follows. The vertex set of X is the set of cosets

Two vertices gK and fH are adjacent in X whenever there exists k ∈ K such that fH = gkH (or, equivalently, whenever there is h ∈ H such that gK = fhK).

The G-stabilizer of every vertex of X of type gK is equal to gKg−1 and the G-stabilizer of every vertex of X of type gH is equal to gHg−1. For an edge [gH, ghK] of X its G-stabilizer is equal to ghα(C)h−1g−1.

For every c ∈ C and h ∈ 'k ∈ K' the edges [gH, ghK] and [gH, ghα(c)K] are equal and the degree of the vertex gH in X is equal to the index [H:α(C)]. Similarly, every vertex of type gK has degree [K:ω(C)] in X.

HNN extension

[edit]

Let A be a graph of groups consisting of a single loop-edge e (together with its formal inverse e), a single vertex v = o(e) = t(e), a vertex group B = Av, an edge group C = Ae and the boundary monomorphisms . Then T = v is a spanning tree in A and the fundamental group π1(A, T) is isomorphic to the HNN extension

with the base group B, stable letter e and the associated subgroups H = α(C), K = ω(C) in B. The composition is an isomorphism and the above HNN-extension presentation of G can be rewritten as

In this case the Bass–Serre tree can be described as follows. The vertex set of X is the set of cosets VX = {gB : gG}.

Two vertices gB and fB are adjacent in X whenever there exists b in B such that either fB = gbeB or fB = gbe−1B. The G-stabilizer of every vertex of X is conjugate to B in G and the stabilizer of every edge of X is conjugate to H in G. Every vertex of X has degree equal to [B : H] + [B : K].

A graph with the trivial graph of groups structure

[edit]

Let A be a graph of groups with underlying graph A such that all the vertex and edge groups in A are trivial. Let v be a base-vertex in A. Then π1(A,v) is equal to the fundamental group π1(A,v) of the underlying graph A in the standard sense of algebraic topology and the Bass–Serre covering tree is equal to the standard universal covering space of A. Moreover, the action of π1(A,v) on is exactly the standard action of π1(A,v) on by deck transformations.

Basic facts and properties

[edit]
  • If A is a graph of groups with a spanning tree T and if G = π1(A, T), then for every vertex v of A the canonical homomorphism from Av to G is injective.
  • If gG is an element of finite order then g is conjugate in G to an element of finite order in some vertex group Av.
  • If FG is a finite subgroup then F is conjugate in G to a subgroup of some vertex group Av.
  • If the graph A is finite and all vertex groups Av are finite then the group G is virtually free, that is, G contains a free subgroup of finite index.
  • If A is finite and all the vertex groups Av are finitely generated then G is finitely generated.
  • If A is finite and all the vertex groups Av are finitely presented and all the edge groups Ae are finitely generated then G is finitely presented.

Trivial and nontrivial actions

[edit]

A graph of groups A is called trivial if A = T is already a tree and there is some vertex v of A such that Av = π1(A, A). This is equivalent to the condition that A is a tree and that for every edge e = [uz] of A (with o(e) = u, t(e) = z) such that u is closer to v than z we have [Az : ωe(Ae)] = 1, that is Az = ωe(Ae).

An action of a group G on a tree X without edge-inversions is called trivial if there exists a vertex x of X that is fixed by G, that is such that Gx = x. It is known that an action of G on X is trivial if and only if the quotient graph of groups for that action is trivial.

Typically, only nontrivial actions on trees are studied in Bass–Serre theory since trivial graphs of groups do not carry any interesting algebraic information, although trivial actions in the above sense (e. g. actions of groups by automorphisms on rooted trees) may also be interesting for other mathematical reasons.

One of the classic and still important results of the theory is a theorem of Stallings about ends of groups. The theorem states that a finitely generated group has more than one end if and only if this group admits a nontrivial splitting over finite subgroups that is, if and only if the group admits a nontrivial action without inversions on a tree with finite edge stabilizers.[11]

An important general result of the theory states that if G is a group with Kazhdan's property (T) then G does not admit any nontrivial splitting, that is, that any action of G on a tree X without edge-inversions has a global fixed vertex.[12]

Hyperbolic length functions

[edit]

Let G be a group acting on a tree X without edge-inversions.

For every gG put

Then X(g) is called the translation length of g on X.

The function

is called the hyperbolic length function or the translation length function for the action of G on X.

Basic facts regarding hyperbolic length functions

[edit]
  • For g ∈ G exactly one of the following holds:
(a) X(g) = 0 and g fixes a vertex of G. In this case g is called an elliptic element of G.
(b) X(g) > 0 and there is a unique bi-infinite embedded line in X, called the axis of g and denoted Lg which is g-invariant. In this case g acts on Lg by translation of magnitude X(g) and the element g ∈ G is called hyperbolic.
  • If X(G) ≠ 0 then there exists a unique minimal G-invariant subtree XG of X. Moreover, XG is equal to the union of axes of hyperbolic elements of G.

The length-function X : GZ is said to be abelian if it is a group homomorphism from G to Z and non-abelian otherwise. Similarly, the action of G on X is said to be abelian if the associated hyperbolic length function is abelian and is said to be non-abelian otherwise.

In general, an action of G on a tree X without edge-inversions is said to be minimal if there are no proper G-invariant subtrees in X.

An important fact in the theory says that minimal non-abelian tree actions are uniquely determined by their hyperbolic length functions:[13]

Uniqueness theorem

[edit]

Let G be a group with two nonabelian minimal actions without edge-inversions on trees X and Y. Suppose that the hyperbolic length functions X and Y on G are equal, that is X(g) = Y(g) for every g ∈ G. Then the actions of G on X and Y are equal in the sense that there exists a graph isomorphism f : X → Y which is G-equivariant, that is f(gx) = g f(x) for every g ∈ G and every x ∈ VX.

Important developments in Bass–Serre theory

[edit]

Important developments in Bass–Serre theory in the last 30 years include:

  • Various accessibility results for finitely presented groups that bound the complexity (that is, the number of edges) in a graph of groups decomposition of a finitely presented group, where some algebraic or geometric restrictions on the types of groups considered are imposed. These results include:
    • Dunwoody's theorem about accessibility of finitely presented groups[14] stating that for any finitely presented group G there exists a bound on the complexity of splittings of G over finite subgroups (the splittings are required to satisfy a technical assumption of being "reduced");
    • Bestvina–Feighn generalized accessibility theorem[15] stating that for any finitely presented group G there is a bound on the complexity of reduced splittings of G over small subgroups (the class of small groups includes, in particular, all groups that do not contain non-abelian free subgroups);
    • Acylindrical accessibility results for finitely presented (Sela,[16] Delzant[17]) and finitely generated (Weidmann[18]) groups which bound the complexity of the so-called acylindrical splittings, that is splittings where for their Bass–Serre covering trees the diameters of fixed subsets of nontrivial elements of G are uniformly bounded.
  • The theory of JSJ-decompositions for finitely presented groups. This theory was motivated by the classic notion of JSJ decomposition in 3-manifold topology and was initiated, in the context of word-hyperbolic groups, by the work of Sela. JSJ decompositions are splittings of finitely presented groups over some classes of small subgroups (cyclic, abelian, noetherian, etc., depending on the version of the theory) that provide a canonical descriptions, in terms of some standard moves, of all splittings of the group over subgroups of the class. There are a number of versions of JSJ-decomposition theories:
  • The theory of lattices in automorphism groups of trees. The theory of tree lattices was developed by Bass, Kulkarni and Lubotzky[25][26] by analogy with the theory of lattices in Lie groups (that is discrete subgroups of Lie groups of finite co-volume). For a discrete subgroup G of the automorphism group of a locally finite tree X one can define a natural notion of volume for the quotient graph of groups A as
The group G is called an X-lattice if vol(A)< ∞. The theory of tree lattices turns out to be useful in the study of discrete subgroups of algebraic groups over non-archimedean local fields and in the study of Kac–Moody groups.
  • Development of foldings and Nielsen methods for approximating group actions on trees and analyzing their subgroup structure.[27][18][28][29]
  • The theory of ends and relative ends of groups, particularly various generalizations of Stallings theorem about groups with more than one end.[30][31][32]
  • Quasi-isometric rigidity results for groups acting on trees.[33]

Generalizations

[edit]

There have been several generalizations of Bass–Serre theory:

  • The theory of complexes of groups (see Haefliger,[34] Corson[35] Bridson-Haefliger[36]) provides a higher-dimensional generalization of Bass–Serre theory. The notion of a graph of groups is replaced by that of a complex of groups, where groups are assigned to each cell in a simplicial complex, together with monomorphisms between these groups corresponding to face inclusions (these monomorphisms are required to satisfy certain compatibility conditions). One can then define an analog of the fundamental group of a graph of groups for a complex of groups. However, in order for this notion to have good algebraic properties (such as embeddability of the vertex groups in it) and in order for a good analog for the notion of the Bass–Serre covering tree to exist in this context, one needs to require some sort of "non-positive curvature" condition for the complex of groups in question (see, for example [37][38]).
  • The theory of isometric group actions on real trees (or R-trees) which are metric spaces generalizing the graph-theoretic notion of a tree (graph theory). The theory was developed largely in the 1990s, where the Rips machine of Eliyahu Rips on the structure theory of stable group actions on R-trees played a key role (see Bestvina-Feighn[39]). This structure theory assigns to a stable isometric action of a finitely generated group G a certain "normal form" approximation of that action by a stable action of G on a simplicial tree and hence a splitting of G in the sense of Bass–Serre theory. Group actions on real trees arise naturally in several contexts in geometric topology: for example as boundary points of the Teichmüller space[40] (every point in the Thurston boundary of the Teichmüller space is represented by a measured geodesic lamination on the surface; this lamination lifts to the universal cover of the surface and a naturally dual object to that lift is an R-tree endowed with an isometric action of the fundamental group of the surface), as Gromov-Hausdorff limits of, appropriately rescaled, Kleinian group actions,[41][42] and so on. The use of R-trees machinery provides substantial shortcuts in modern proofs of Thurston's Hyperbolization Theorem for Haken 3-manifolds.[42][43] Similarly, R-trees play a key role in the study of Culler-Vogtmann's Outer space[44][45] as well as in other areas of geometric group theory; for example, asymptotic cones of groups often have a tree-like structure and give rise to group actions on real trees.[46][47] The use of R-trees, together with Bass–Serre theory, is a key tool in the work of Sela on solving the isomorphism problem for (torsion-free) word-hyperbolic groups, Sela's version of the JSJ-decomposition theory and the work of Sela on the Tarski Conjecture for free groups and the theory of limit groups.[48][49]
  • The theory of group actions on Λ-trees, where Λ is an ordered abelian group (such as R or Z) provides a further generalization of both the Bass–Serre theory and the theory of group actions on R-trees (see Morgan,[50] Alperin-Bass,[13] Chiswell[51]).

See also

[edit]

References

[edit]
  1. ^ Serre, J.-P. (1977). "Arbres, amalgames, SL2. Rédigé avec la collaboration de Hyman Bass" (PDF). Astérisque, Société Mathématique de France, Paris. 46. MR 0476875.
  2. ^ a b c Serre, Jean-Pierre (1980). Trees. Translated from the French by. John Stillwell. doi:10.1007/978-3-642-61856-7. ISBN 978-3-642-61858-1.
  3. ^ a b Bass, Hyman (1993). "Covering theory for graphs of groups". Journal of Pure and Applied Algebra. 89 (1–2): 3–47. doi:10.1016/0022-4049(93)90085-8.
  4. ^ Scott, Peter; Wall, Terry (1979). "Topological methods in group theory". Homological Group Theory. London Mathematical Society Lecture Notes Series, vol. 36. pp. 137–204. doi:10.1017/CBO9781107325449.007. ISBN 9780521227292.
  5. ^ Hatcher, Allen (2002). "1.B". Algebraic topology. Cambridge, UK: Cambridge University Press. p. 91. ISBN 9780521795401. OCLC 45420394.
  6. ^ Baumslag, Gilbert (1993). Topics in Combinatorial Group Theory. Lectures in Mathematics. ETH Zürich. doi:10.1007/978-3-0348-8587-4. ISBN 978-3-7643-2921-1.
  7. ^ Dicks, Warren; Dunwoody, M. J. (1989). Groups Acting on Graphs. Cambridge Studies in Advanced Mathematics, 17. ISBN 9780521230339.
  8. ^ Cohen, Daniel E. (1989). Combinatorial group theory: a topological approach. London Mathematical Society Student Texts, 14. doi:10.1017/CBO9780511565878. ISBN 9780521349369.
  9. ^ Higgins, P. J. (1976). "The Fundamental Groupoid of a Graph of Groups". Journal of the London Mathematical Society: 145–149. doi:10.1112/jlms/s2-13.1.145.
  10. ^ Moore, E.J. (2001). "Graphs of groups: word computations and free crossed resolutions". PhD Thesis, University of Wales, Bangor. Archived from the original on January 9, 2014.
  11. ^ Stallings, John (1970). "Groups of cohomological dimension one". Applications of Categorical Algebra. Proceedings of Symposia in Pure Mathematics. Vol. 17. pp. 124–128. doi:10.1090/pspum/017/0255689. ISBN 9780821814178.
  12. ^ Y. Watatani. Property T of Kazhdan implies property FA of Serre. Mathematica Japonica, vol. 27 (1982), no. 1, pp. 97–103
  13. ^ a b R. Alperin and H. Bass. Length functions of group actions on Λ-trees. in: Combinatorial group theory and topology (Alta, Utah, 1984), pp. 265–378, Annals of Mathematical Studies, 111, Princeton University Press, Princeton, NJ, 1987; ISBN 0-691-08409-2
  14. ^ Dunwoody, M. J. (1985). "The accessibility of finitely presented groups". Inventiones Mathematicae. 81 (3): 449–457. Bibcode:1985InMat..81..449D. doi:10.1007/BF01388581. S2CID 120065939.
  15. ^ Bestvina, Mladen; Feighn, Mark (1991). "Bounding the complexity of simplicial group actions on trees". Inventiones Mathematicae. 103: 449–469. Bibcode:1991InMat.103..449B. doi:10.1007/BF01239522. S2CID 121136037.
  16. ^ Sela, Z. (1997). "Acylindrical accessibility for groups". Inventiones Mathematicae. 129 (3): 527–565. Bibcode:1997InMat.129..527S. doi:10.1007/s002220050172. S2CID 122548154.
  17. ^ Delzant, Thomas (1999). "Sur l'accessibilité acylindrique des groupes de présentation finie". Annales de l'Institut Fourier. 49 (4): 1215–1224. doi:10.5802/aif.1714.
  18. ^ a b R. Weidmann. The Nielsen method for groups acting on trees. Proceedings of the London Mathematical Society (3), vol. 85 (2002), no. 1, pp. 93–118
  19. ^ Sela, Z. (1997). "Structure and Rigidity in (Gromov) Hyperbolic Groups and Discrete Groups in Rank 1 Lie Groups II". Geometric and Functional Analysis. 7 (3): 561–593. doi:10.1007/s000390050019. S2CID 120486267.
  20. ^ Bowditch, Brian H. (1998). "Cut points and canonical splittings of hyperbolic groups" (PDF). Acta Mathematica. 180 (2): 145–186. doi:10.1007/BF02392898. S2CID 121148668.
  21. ^ Rips, E.; Sela, Z. (1997). "Cyclic Splittings of Finitely Presented Groups and the Canonical JSJ Decomposition". Annals of Mathematics. 146 (1): 53–109. doi:10.2307/2951832. JSTOR 2951832.
  22. ^ M. J. Dunwoody, and M. E. Sageev, JSJ-splittings for finitely presented groups over slender groups. Inventiones Mathematicae, vol. 135 (1999), no. 1, pp. 25–44.
  23. ^ Fujiwara, K.; Papasoglu, P. (2006). "JSJ-Decompositions of finitely presented groups and complexes of groups". Geometric and Functional Analysis. 16: 70–125. arXiv:math/0507424. doi:10.1007/s00039-006-0550-2. S2CID 10105697.
  24. ^ Scott, P.; Swarup, G.A. (2003). "Regular neighbourhoods and canonical decompositions for groups" (PDF). Astérisque. 289. MR 2032389.
  25. ^ Bass, Hyman; Kulkarni, Ravi (1990). "Uniform tree lattices". J. Amer. Math. Soc. 3 (4): 843–902. doi:10.1090/S0894-0347-1990-1065928-2.
  26. ^ Lubotzky, A (1995). "Tree-lattices and lattices in Lie groups". Combinatorial and Geometric Group Theory, (Edinburgh 1993). London Mathematical Society Lecture Notes Series: 204. pp. 217–232. doi:10.1017/CBO9780511566073.016. ISBN 9780511566073.
  27. ^ Bestvina, Mladen; Feighn, Mark (1991). "Bounding the complexity of simplicial group actions on trees". Inventiones Mathematicae. 103: 449–469. Bibcode:1991InMat.103..449B. doi:10.1007/BF01239522. S2CID 121136037.
  28. ^ J.-R. Stallings. Foldings of G-trees. in: "Arboreal Group Theory (Berkeley, CA, 1988)", Math. Sci. Res. Inst. Publ. 19 (Springer, New York, 1991), pp. 355–368. ISBN 0-387-97518-7
  29. ^ Kapovich, Ilya; Weidmann, Richard; Myasnikov, Alexei (2005). "Foldings, Graphs of Groups and the Membership Problem". International Journal of Algebra and Computation. 15: 95–128. arXiv:math/0302206. doi:10.1142/S021819670500213X. S2CID 6912598.
  30. ^ Scott, G. P. and Swarup, G. A. An algebraic annulus theorem. Pacific Journal of Mathematics, vol. 196 (2000), no. 2, pp. 461–506
  31. ^ M. J. Dunwoody, and E. L. Swenson, E. L. The algebraic torus theorem. Inventiones Mathematicae. vol. 140 (2000), no. 3, pp. 605–637
  32. ^ M. Sageev. Codimension-1 subgroups and splittings of groups. Journal of Algebra, vol. 189 (1997), no. 2, pp. 377–389.
  33. ^ P. Papasoglu. Group splittings and asymptotic topology. Journal für die Reine und Angewandte Mathematik, vol. 602 (2007), pp. 1–16.
  34. ^ André Haefliger. Complexes of groups and orbihedra. in: "Group theory from a geometrical viewpoint (Trieste, 1990)", pp. 504–540, World Sci. Publ., River Edge, NJ, 1991. ISBN 981-02-0442-6
  35. ^ Corson, Jon Michael (1992). "Complexes of Groups". Proceedings of the London Mathematical Society: 199–224. doi:10.1112/plms/s3-65.1.199.
  36. ^ Martin R. Bridson, and André Haefliger. Metric spaces of non-positive curvature. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], 319. Springer-Verlag, Berlin, 1999. ISBN 3-540-64324-9
  37. ^ Wise, Daniel T. (2002). "The residual finiteness of negatively curved polygons of finite groups". Inventiones Mathematicae. 149 (3): 579–617. Bibcode:2002InMat.149..579W. doi:10.1007/s002220200224. S2CID 122345756.
  38. ^ John R. Stallings. Non-positively curved triangles of groups. in: "Group theory from a geometrical viewpoint (Trieste, 1990)", pp. 491–503, World Scientific Publishing, River Edge, NJ, 1991; ISBN 981-02-0442-6
  39. ^ Mladen Bestvina, and Mark Feighn. Stable actions of groups on real trees. Inventiones Mathematicae, vol. 121 (1995), no. 2, pp. 287–321
  40. ^ Skora, Richard K. (July 1990). "Splittings of surfaces". Bulletin (New Series) of the American Mathematical Society. 23 (1): 85–90. doi:10.1090/S0273-0979-1990-15907-5.
  41. ^ Bestvina, Mladen (1988). "Degenerations of the hyperbolic space". Duke Mathematical Journal. 56 (1): 143–161. doi:10.1215/S0012-7094-88-05607-4.
  42. ^ a b Kapovich, Michael (2010). Hyperbolic Manifolds and Discrete Groups. doi:10.1007/978-0-8176-4913-5. ISBN 978-0-8176-4912-8.
  43. ^ J.-P. Otal. The hyperbolization theorem for fibered 3-manifolds. Translated from the 1996 French original by Leslie D. Kay. SMF/AMS Texts and Monographs, 7. American Mathematical Society, Providence, RI; Société Mathématique de France, Paris. ISBN 0-8218-2153-9
  44. ^ Cohen, Marshall M.; Lustig, Martin (1995). "Very small group actions on R-trees and dehn twist automorphisms". Topology. 34 (3): 575–617. doi:10.1016/0040-9383(94)00038-M.
  45. ^ Levitt, Gilbert; Lustig, Martin (2003). "Irreducible automorphisms of Fn have north-south dynamics on compactified outer space". Journal of the Institute of Mathematics of Jussieu. 2 (1). doi:10.1017/S1474748003000033. S2CID 120675231.
  46. ^ Cornelia Druţu and Mark Sapir. Tree-graded spaces and asymptotic cones of groups. (With an appendix by Denis Osin and Mark Sapir.) Topology, vol. 44 (2005), no. 5, pp. 959–1058
  47. ^ Druţu, Cornelia; Sapir, Mark V. (2008). "Groups acting on tree-graded spaces and splittings of relatively hyperbolic groups". Advances in Mathematics. 217 (3): 1313–1367. doi:10.1016/j.aim.2007.08.012. S2CID 10461978.
  48. ^ Sela, Zlil (2003). "Diophantine geometry over groups and the elementary theory of free and hyperbolic groups". Proceedings of the ICM, Beijing 2002, vol.2 (PDF). pp. 87–92. arXiv:math/0304209. Bibcode:2003math......4209S. ISBN 7-04-008690-5.
  49. ^ Sela, Zlil (2001). "Diophantine geometry over groups I : Makanin-Razborov diagrams" (PDF). Publications Mathématiques de l'IHÉS. 93: 31–105. doi:10.1007/s10240-001-8188-y. S2CID 51799226.
  50. ^ Morgan, John W. (1992). "Λ-trees and their applications". Bulletin of the American Mathematical Society. 26: 87–112. arXiv:math/9201265. doi:10.1090/S0273-0979-1992-00237-9. S2CID 18252851.
  51. ^ Chiswell, Ian (2001). Introduction to Λ-Trees. doi:10.1142/4495. ISBN 978-981-02-4386-9.
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy