scholarly journals A note on groups with separable finitely generated subgroups

1987 ◽  
Vol 36 (1) ◽  
pp. 153-160 ◽  
Author(s):  
R. G. Burns ◽  
A. Karrass ◽  
D. Solitar
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Cyclic Extension ◽  
Normal Subgroups ◽  
Finitely Generated ◽  
Positive Direction ◽  
One Relator Groups

An example is given of an infinite cyclic extension of a free group of finite rank in which not every finitely generated subgroup is finitely separable. This answers negatively the question of Peter Scott as to whether in all finitely generated 3-manifold groups the finitely generated subgroups are finitely separable. In the positive direction it is shown that in knot groups and one-relator groups with centre, the finitely generated normal subgroups are finitely separable.

scholarly journals Finitely generated cyclic extensions of free groups are residually finite

1971 ◽  
Vol 5 (1) ◽  
pp. 87-94 ◽  
Author(s):  
Gilbert Baumslag
Keyword(s):  
Free Group ◽  
Principal Ideal ◽  
Free Groups ◽  
Cyclic Extension ◽  
Principal Ideal Domain ◽  
Finitely Generated ◽  
Finitely Generated Module ◽  
Residually Finite ◽  
Ideal Domain ◽  
Direct Sum

We establish the result that a finitely generated cyclic extension of a free group is residually finite. This is done, in part, by making use of the fact that a finitely generated module over a principal ideal domain is a direct sum of cyclic modules.

scholarly journals ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM

2007 ◽  
Vol 17 (08) ◽  
pp. 1611-1634 ◽  
Author(s):  
ABDÓ ROIG ◽  
ENRIC VENTURA ◽  
PASCAL WEIL
Keyword(s):  
Free Group ◽  
Polynomial Time ◽  
Minimization Problem ◽  
Finite Rank ◽  
Polynomial Algorithm ◽  
Minimum Size ◽  
Input Word ◽  
Finitely Generated ◽  
Factor Problem

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to solve this problem, that is, an algorithm that is polynomial both in the length of the input word and in the rank of the free group. Earlier algorithms had an exponential dependency in the rank of the free group. It follows that the primitivity problem — to decide whether a word is an element of some basis of the free group — and the free factor problem can also be solved in polynomial time.

scholarly journals RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP

2008 ◽  
Vol 18 (02) ◽  
pp. 375-405 ◽  
Author(s):  
FRÉDÉRIQUE BASSINO ◽  
CYRIL NICAUD ◽  
PASCAL WEIL
Keyword(s):  
Uniform Distribution ◽  
Free Group ◽  
Finite Index ◽  
Finite Rank ◽  
Efficient Algorithm ◽  
Random Generation ◽  
Finitely Generated ◽  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be obtained by the method of Stallings foldings. Our algorithm randomly generates a subgroup of a given size n, according to the uniform distribution over size n subgroups. In the process, we give estimates of the number of size n subgroups, of the average rank of size n subgroups, and of the proportion of such subgroups that have finite index. Our algorithm has average case complexity [Formula: see text] in the RAM model and [Formula: see text] in the bitcost model.

scholarly journals Groups with a quotient that contains the original group as a direct factor

1992 ◽  
Vol 45 (3) ◽  
pp. 513-520 ◽  
Author(s):  
Ron Hirshon ◽  
David Meier
Keyword(s):  
Free Group ◽  
Normal Subgroups ◽  
Direct Factor ◽  
Finitely Generated ◽  
Finitely Generated Group ◽  
Finitely Presented Group ◽  
Finitely Generated Groups ◽  
Original Group ◽  
Hopfian Group ◽  
Finitely Presented

We prove that given a finitely generated group G with a homomorphism of G onto G × H, H non-trivial, or a finitely generated group G with a homomorphism of G onto G × G, we can always find normal subgroups N ≠ G such that G/N ≅ G/N × H or G/N ≅ G/N × G/N respectively. We also show that given a finitely presented non-Hopfian group U and a homomorphism φ of U onto U, which is not an isomorphism, we can always find a finitely presented group H ⊇ U and a finitely generated free group F such that φ induces a homomorphism of U * F onto (U * F) × H. Together with the results above this allows the construction of many examples of finitely generated groups G with G ≅ G × H where H is finitely presented. A finitely presented group G with a homomorphism of G onto G × G was first constructed by Baumslag and Miller. We use a slight generalisation of their method to obtain more examples of such groups.

scholarly journals ON THE LOCAL-INDICABILITY COHEN–LYNDON THEOREM

2011 ◽  
Vol 53 (3) ◽  
pp. 637-656 ◽  
Author(s):  
YAGO ANTOLÍN ◽  
WARREN DICKS ◽  
PETER A. LINNELL
Keyword(s):  
Free Group ◽  
Normal Subgroups ◽  
Induction Method ◽  
Free Products ◽  
Detailed Review ◽  
Generating Set ◽  
Inductive Proof ◽  
Trivial Element ◽  
One Relator Groups ◽  
Indicable Group

AbstractFor a group H and a subset X of H, we let HX denote the set {hxh−1 | h ∈ H, x ∈ X}, and when X is a free-generating set of H, we say that the set HX is a Whitehead subset of H. For a group F and an element r of F, we say that r is Cohen–Lyndon aspherical in F if F{r} is a Whitehead subset of the subgroup of F that is generated by F{r}. In 1963, Cohen and Lyndon (D. E. Cohen and R. C. Lyndon, Free bases for normal subgroups of free groups, Trans. Amer. Math. Soc. 108 (1963), 526–537) independently showed that in each free group each non-trivial element is Cohen–Lyndon aspherical. Their proof used the celebrated induction method devised by Magnus in 1930 to study one-relator groups. In 1987, Edjvet and Howie (M. Edjvet and J. Howie, A Cohen–Lyndon theorem for free products of locally indicable groups, J. Pure Appl. Algebra45 (1987), 41–44) showed that if A and B are locally indicable groups, then each cyclically reduced element of A*B that does not lie in A ∪ B is Cohen–Lyndon aspherical in A*B. Their proof used the original Cohen–Lyndon theorem. Using Bass–Serre theory, the original Cohen–Lyndon theorem and the Edjvet–Howie theorem, one can deduce the local-indicability Cohen–Lyndon theorem: if F is a locally indicable group and T is an F-tree with trivial edge stabilisers, then each element of F that fixes no vertex of T is Cohen–Lyndon aspherical in F. Conversely, by Bass–Serre theory, the original Cohen–Lyndon theorem and the Edjvet–Howie theorem are immediate consequences of the local-indicability Cohen–Lyndon theorem. In this paper we give a detailed review of a Bass–Serre theoretical form of Howie induction and arrange the arguments of Edjvet and Howie into a Howie-inductive proof of the local-indicability Cohen–Lyndon theorem that uses neither Magnus induction nor the original Cohen–Lyndon theorem. We conclude with a review of some standard applications of Cohen–Lyndon asphericity.

The abelianization of the congruence IA-automorphism group of a free group

2007 ◽  
Vol 142 (2) ◽  
pp. 239-248 ◽  
Author(s):  
TAKAO SATOH
Keyword(s):  
Automorphism Group ◽  
Free Group ◽  
Quotient Group ◽  
Homology Group ◽  
Integral Homology ◽  
Normal Subgroups ◽  
Finitely Generated ◽  
Homology Groups ◽  
Inner Automorphism

AbstractWe consider the abelianizations of some normal subgroups of the automorphism group of a finitely generated free group. Let Fn be a free group of rank n. For d ≥ 2, we consider a group consisting the automorphisms of Fn which act trivially on the first homology group of Fn with ${\mathbf Z}$/d${\mathbf Z}$-coefficients. We call it the congruence IA-automorphism group of level d and denote it by IAn,d. Let IOn,d be the quotient group of the congruence IA-automorphism group of level d by the inner automorphism group of a free group. We determine the abelianization of IAn,d and IOn,d for n ≥ 2 and d ≥ 2. Furthermore, for n=2 and odd prime p, we compute the integral homology groups of IA2,p for any dimension.

Counterexamples to Two Problems on One-Relator Groups

1976 ◽  
Vol 19 (3) ◽  
pp. 363-364 ◽  
Author(s):  
J. Fischer
Keyword(s):  
Finite Rank ◽  
Free Subgroup ◽  
Finitely Generated ◽  
One Relator Groups

In [2] G. Baumslag presents a list of twenty-three unsolved problems on one-relator groups. We give counterexamples to two of them.Problem 5 asks whether a maximal locally free subgroup of a one-relator group always has finite “rank” (G has “rank” k if each finitely generated subgroup of G is contained in a k-generator subgroup of G).

Finitely generated subgroups of free groups as formal languages and their cogrowth

2021 ◽  
Vol volume 13, issue 2 ◽  
Author(s):  
Arman Darbinyan ◽  
Rostislav Grigorchuk ◽  
Asif Shaikh
Keyword(s):  
Free Group ◽  
Finite Automaton ◽  
Finite Rank ◽  
Regular Language ◽  
Free Groups ◽  
Formal Languages ◽  
Finitely Generated ◽  
Deterministic Finite Automaton ◽  
Method Of Calculation ◽  
Reduced Words

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the minimal deterministic finite automaton that recognizes $L_H$. Then we characterize the f.g. subgroups $H$ for which $L_H$ is irreducible and for such groups explicitly construct ergodic automaton that recognizes $L_H$. This construction gives us an efficient way to compute the cogrowth series $L_H(z)$ of $H$ and entropy of $L_H$. Several examples illustrate the method and a comparison is made with the method of calculation of $L_H(z)$ based on the use of Nielsen system of generators of $H$.

scholarly journals Folding-like techniques for CAT(0) cube complexes

2021 ◽  
pp. 1-12
Author(s):  
MICHAEL BEN–ZVI ◽  
ROBERT KROPHOLLER ◽  
RYLEE ALANZA LYMAN
Keyword(s):  
Free Group ◽  
Finite Rank ◽  
Coxeter Groups ◽  
Free Groups ◽  
Fundamental Groups ◽  
Finitely Generated ◽  
Seminal Paper ◽  
Finite Graphs ◽  
Cube Complexes ◽  
Positively Curved

Abstract In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings’s methods allow one to construct this representation algorithmically, giving effective, algorithmic answers and proofs to classical questions about subgroups of free groups. Recently Dani–Levcovitz used Stallings-like methods to study subgroups of right-angled Coxeter groups, which act geometrically on CAT(0) cube complexes. In this paper we extend their techniques to fundamental groups of non-positively curved cube complexes.

Remarks on the Intersection of Finitely Generated Subgroups of a Free Group

1986 ◽  
Vol 29 (2) ◽  
pp. 204-207 ◽  
Author(s):  
R. G. Burns ◽  
Wilfried Imrich ◽  
Brigitte Servatius
Keyword(s):  
Free Group ◽  
Finite Index ◽  
Finite Rank ◽  
Short Proof ◽  
Finitely Generated ◽  
Modest Improvement ◽  
General Bound

AbstractThe first result gives a (modest) improvement of the best general bound known to date for the rank of the intersection U ∩ V of two finite-rank subgroups of a free group F in terms of the ranks of U and V. In the second result it is deduced from that bound that if A is a finite-rank subgroup of F and B < F is non-cyclic, then the index of A ∩ B in B, if finite, is less than 2(rank(A) - 1), whence in particular if rank (A) = 2, then B ≤ A. (This strengthens a lemma of Gersten.) Finally a short proof is given of Stallings' result that if U, V (as above) are such that U ∩ V has finite index in both U and V, then it has finite index in their join 〈U, V〉.

Sign in / Sign up

Export Citation Format

Share Document