On subgroups of finite complexity in groups acting on trees. (Q557055)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2182114
Language Label Description Also known as
default for all languages
No label defined
    English
    On subgroups of finite complexity in groups acting on trees.
    scientific article; zbMATH DE number 2182114

      Statements

      On subgroups of finite complexity in groups acting on trees. (English)
      0 references
      0 references
      23 June 2005
      0 references
      Suppose that \(G\) is a group acting on a tree \(X\). Given a subgroup \(H\) of \(G\), the author studies the existence of invariants of \(H\), uniquely determined by the action of \(H\) on \(X\). For this he describes some properties of subgroups of finite complexity, an extension of the Schreier index formula for the rank of subgroups of finite index in free groups, to the case of subgroups of finite index in amalgamated free products. He also shows that all isomorphic subgroups of finite index in a finitely presented group with infinitely many ends have the same index, and that fixed subgroups of symmetric endomorphisms of fundamental groups of graphs of groups whose edge groups are all finite, are tame. Finally, the chains of subgroups of finite complexity are described.
      0 references
      0 references
      group actions on trees
      0 references
      subgroups of finite complexity
      0 references
      Schreier index formula
      0 references
      amalgamated free products
      0 references
      graphs of groups
      0 references
      subgroups of finite index
      0 references
      finitely presented groups
      0 references
      numbers of ends
      0 references
      tame subgroups
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references