scholarly journals COSET ENUMERATION FOR CERTAIN INFINITELY PRESENTED GROUPS

2011 ◽  
Vol 21 (08) ◽  
pp. 1369-1380 ◽  
Author(s):  
RENÉ HARTUNG
Keyword(s):  
Finite Index ◽  
Membership Problem ◽  
Finitely Generated ◽  
Grigorchuk Group ◽  
Self Similar ◽  
Coset Enumeration ◽  
Finite Index Subgroups ◽  
Subgroup Membership Problem

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely L-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in a finitely L-presented group is decidable. As an application, we consider the low-index subgroups of some self-similar groups including the Grigorchuk group, the twisted twin of the Grigorchuk group, the Grigorchuk super-group, and the Hanoi 3-group.

scholarly journals Statistics of subgroups of the modular group

2021 ◽  
pp. 1-61
Author(s):  
Frédérique Bassino ◽  
Cyril Nicaud ◽  
Pascal Weil
Keyword(s):  
Finite Index ◽  
Modular Group ◽  
Large Deviation ◽  
Free Subgroup ◽  
Index Formula ◽  
Index Subgroup ◽  
Finitely Generated ◽  
Finite Index Subgroup ◽  
Free Subgroups ◽  
Finite Index Subgroups

We count the finitely generated subgroups of the modular group [Formula: see text]. More precisely, each such subgroup [Formula: see text] can be represented by its Stallings graph [Formula: see text], we consider the number of vertices of [Formula: see text] to be the size of [Formula: see text] and we count the subgroups of size [Formula: see text]. Since an index [Formula: see text] subgroup has size [Formula: see text], our results generalize the known results on the enumeration of the finite index subgroups of [Formula: see text]. We give asymptotic equivalents for the number of finitely generated subgroups of [Formula: see text], as well as of the number of finite index subgroups, free subgroups and free finite index subgroups. We also give the expected value of the isomorphism type of a size [Formula: see text] subgroup and prove a large deviation statement concerning this value. Similar results are proved for finite index and for free subgroups. Finally, we show how to efficiently generate uniformly at random a size [Formula: see text] subgroup (respectively, finite index subgroup, free subgroup) of [Formula: see text].

scholarly journals VIRTUAL ALGEBRAIC FIBRATIONS OF KÄHLER GROUPS

2019 ◽  
pp. 1-19
Author(s):  
STEFAN FRIEDL ◽  
STEFANO VIDUSSI
Keyword(s):  
Fundamental Group ◽  
Finite Index ◽  
Surface Groups ◽  
Index Subgroup ◽  
Finitely Generated ◽  
Kähler Surfaces ◽  
Kähler Groups ◽  
Strong Relation ◽  
Finite Index Subgroup ◽  
Finite Index Subgroups

This paper stems from the observation (arising from work of Delzant) that “most” Kähler groups $G$ virtually algebraically fiber, that is, admit a finite index subgroup that maps onto $\mathbb{Z}$ with finitely generated kernel. For the remaining ones, the Albanese dimension of all finite index subgroups is at most one, that is, they have virtual Albanese dimension $va(G)\leqslant 1$ . We show that the existence of algebraic fibrations has implications in the study of coherence and higher BNSR invariants of the fundamental group of aspherical Kähler surfaces. The class of Kähler groups with $va(G)=1$ includes virtual surface groups. Further examples exist; nonetheless, they exhibit a strong relation with surface groups. In fact, we show that the Green–Lazarsfeld sets of groups with $va(G)=1$ (virtually) coincide with those of surface groups, and furthermore that the only virtually RFRS groups with $va(G)=1$ are virtually surface groups.

scholarly journals A note on the Todd-Coxeter coset enumeration algorithm

1976 ◽  
Vol 20 (1) ◽  
pp. 73-79 ◽  
Author(s):  
M. J. Beetham ◽  
C. M. Campbell
Keyword(s):  
Finite Index ◽  
Finitely Generated ◽  
Enumeration Algorithm ◽  
Finitely Presented Group ◽  
Coset Enumeration ◽  
The Given ◽  
Finitely Presented

In (8) Todd and Coxeter described an algorithm for enumerating the cosets of a finitely generated subgroup of finite index in a finitely presented group. Several authors ((1), (2), (5), (6), (7)) have discussed a modification of the algorithm to give also a presentation of the subgroup in terms of the given generators.

scholarly journals VIRTUALLY FIBERING RIGHT-ANGLED COXETER GROUPS

2019 ◽  
pp. 1-31 ◽  
Author(s):  
Kasia Jankiewicz ◽  
Sergey Norin ◽  
Daniel T. Wise
Keyword(s):  
Finite Index ◽  
Morse Theory ◽  
Fundamental Domain ◽  
Coxeter Groups ◽  
Reflection Groups ◽  
Finitely Generated ◽  
The Right ◽  
Finite Index Subgroups

We show that certain right-angled Coxeter groups have finite index subgroups that quotient to $\mathbb{Z}$ with finitely generated kernels. The proof uses Bestvina–Brady Morse theory facilitated by combinatorial arguments. We describe a variety of examples where the plan succeeds or fails. Among the successful examples are the right-angled reflection groups in $\mathbb{H}^{4}$ with fundamental domain the $120$ -cell or the $24$ -cell.

scholarly journals TRANSVERSALS AS GENERATING SETS IN FINITELY GENERATED GROUPS

2015 ◽  
Vol 93 (1) ◽  
pp. 47-60
Author(s):  
JACK BUTTON ◽  
MAURICE CHIODO ◽  
MARIANO ZERON-MEDINA LARIS
Keyword(s):  
Finite Index ◽  
Finitely Generated ◽  
Primitive Elements ◽  
Generating Set ◽  
Generating Sets ◽  
Finitely Generated Groups ◽  
Formula Group ◽  
Finite Index Subgroups ◽  
Finitely Presented

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank-$n$ group $G$ and $H$ has index at least $n$ in $G$, we can construct a left transversal for $H$ which contains a generating set of size $n$ for $G$; this construction is algorithmic when $G$ is finitely presented. We also show that, in the case where $G$ has rank $n\leq 3$, there is a simultaneous left–right transversal for $H$ which contains a generating set of size $n$ for $G$. We finish by showing that if $H$ is a subgroup of a rank-$n$ group $G$ with index less than $3\cdot 2^{n-1}$, and $H$ contains no primitive elements of $G$, then $H$ is normal in $G$ and $G/H\cong C_{2}^{n}$.

Automorphisms of finite order of nilpotent groups II

2014 ◽  
Vol 51 (4) ◽  
pp. 547-555 ◽  
Author(s):  
B. Wehrfritz
Keyword(s):  
Nilpotent Group ◽  
Finite Order ◽  
Finite Index ◽  
Nilpotent Groups ◽  
Finitely Generated

Let G be a nilpotent group with finite abelian ranks (e.g. let G be a finitely generated nilpotent group) and suppose φ is an automorphism of G of finite order m. If γ and ψ denote the associated maps of G given by \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\gamma :g \mapsto g^{ - 1} \cdot g\phi and \psi :g \mapsto g \cdot g\phi \cdot g\phi ^2 \cdots \cdot \cdot g\phi ^{m - 1} for g \in G,$$ \end{document} then Gγ · kerγ and Gψ · ker ψ are both very large in that they contain subgroups of finite index in G.

Numerical upper bounds on growth of automaton groups

2021 ◽  
pp. 1-33
Author(s):  
Jérémie Brieussel ◽  
Thibault Godin ◽  
Bijan Mohammadi
Keyword(s):  
Group Theory ◽  
Upper Bounds ◽  
Geometric Invariant ◽  
Finitely Generated ◽  
Grigorchuk Group ◽  
Finitely Generated Group ◽  
Intermediate Growth ◽  
Mealy Automata ◽  
Optimal Bounds ◽  
Algorithmic Procedure

The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or intermediate, that is between polynomial and exponential. Despite recent spectacular progresses, the class of groups with intermediate growth remains largely mysterious. Many examples of such groups are constructed using Mealy automata. The aim of this paper is to give an algorithmic procedure to study the growth of such automaton groups, and more precisely to provide numerical upper bounds on their exponents. Our functions retrieve known optimal bounds on the famous first Grigorchuk group. They also improve known upper bounds on other automaton groups and permitted us to discover several new examples of automaton groups of intermediate growth. All the algorithms described are implemented in GAP, a language dedicated to computational group theory.

Groups in which every Finitely Generated Subgroup is almost a Free Factor

1979 ◽  
Vol 31 (6) ◽  
pp. 1329-1338 ◽  
Author(s):  
A. M. Brunner ◽  
R. G. Burns
Keyword(s):  
Free Product ◽  
Free Group ◽  
Finite Index ◽  
Finitely Generated ◽  
Free Products

In [5] M. Hall Jr. proved, without stating it explicitly, that every finitely generated subgroup of a free group is a free factor of a subgroup of finite index. This result was made explicit, and used to give simpler proofs of known results, in [1] and [7]. The standard generalization to free products was given in [2]: If, following [13], we call a group in which every finitely generated subgroup is a free factor of a subgroup of finite index an M. Hall group, then a free product of M. Hall groups is again an M. Hall group. The recent appearance of [13], in which this result is reproved, and the rather restrictive nature of the property of being an M. Hall group, led us to attempt to determine the structure of such groups. In this paper we go a considerable way towards achieving this for those M. Hall groups which are both finitely generated and accessible.

On Certain Finitely Generated Subgroups of Groups Which Split

2003 ◽  
Vol 46 (1) ◽  
pp. 122-129 ◽  
Author(s):  
Myoungho Moon
Keyword(s):  
Positive Integer ◽  
Free Product ◽  
Finite Index ◽  
Finitely Generated ◽  
Free Product With Amalgamation

AbstractDefine a group G to be in the class 𝒮 if for any finitely generated subgroup K of G having the property that there is a positive integer n such that gn ∈ K for all g ∈ G, K has finite index in G. We show that a free product with amalgamation A *CB and an HNN group A *C belong to 𝒮, if C is in 𝒮 and every subgroup of C is finitely generated.

scholarly journals DISTORTION IN FREE NILPOTENT GROUPS

2010 ◽  
Vol 20 (05) ◽  
pp. 661-669 ◽  
Author(s):  
TARA C. DAVIS
Keyword(s):  
Nilpotent Group ◽  
Finite Index ◽  
Nilpotent Groups ◽  
Finitely Generated ◽  
Free Nilpotent Group

We prove that a subgroup of a finitely generated free nilpotent group F is undistorted if and only if it is a retract of a subgroup of finite index in F.

Sign in / Sign up

Export Citation Format

Share Document