scholarly journals Erratum: W.5. Jassim, On the intersection of finitely generated subgroups of free groups, Rey. Mat. Univ. Compl.9 (1996), 67-84

1998 ◽  
Vol 11 (2) ◽  
Author(s):  
Warren Dicks
Keyword(s):  
Free Groups ◽  
Finitely Generated

scholarly journals A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS

2006 ◽  
Vol 16 (06) ◽  
pp. 1031-1045 ◽  
Author(s):  
NICHOLAS W. M. TOUIKAN
Keyword(s):  
Free Group ◽  
Fast Algorithm ◽  
Free Groups ◽  
Membership Problem ◽  
Finitely Generated ◽  
Folding Process ◽  
Algorithmic Problems ◽  
The Given

Stalling's folding process is a key algorithm for solving algorithmic problems for finitely generated subgroups of free groups. Given a subgroup H = 〈J1,…,Jm〉 of a finitely generated nonabelian free group F = F(x1,…,xn) the folding porcess enables one, for example, to solve the membership problem or compute the index [F : H]. We show that for a fixed free group F and an arbitrary finitely generated subgroup H (as given above) we can perform the Stallings' folding process in time O(N log *(N)), where N is the sum of the word lengths of the given generators of H.

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 RESTRICTING SUBSETS OF BASES IN RELATIVELY FREE GROUPS

2012 ◽  
Vol 22 (04) ◽  
pp. 1250030
Author(s):  
LUCAS SABALKA ◽  
DMYTRO SAVCHUK
Keyword(s):  
Solvable Group ◽  
Free Group ◽  
Free Groups ◽  
Finitely Generated ◽  
Free Solvable Group ◽  
Relatively Free Group

Let G be a finitely generated free, free abelian of arbitrary exponent, free nilpotent, or free solvable group, or a free group in the variety AmAn, and let A = {a1,…, ar} be a basis for G. We prove that, in most cases, if S is a subset of a basis for G which may be expressed as a word in A without using elements from {al+1,…, ar} for some l < r, then S is a subset of a basis for the relatively free group on {a1,…, al}.

MALNORMALITY IS DECIDABLE IN FREE GROUPS

1999 ◽  
Vol 09 (06) ◽  
pp. 687-692 ◽  
Author(s):  
GILBERT BAUMSLAG ◽  
ALEXEI MYASNIKOV ◽  
VLADIMIR REMESLENNIKOV
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Finitely Generated

We prove here that there is an algorithm whereby one can decide whether or not any finitely generated subgroup of a finitely generated free group is malnormal.

scholarly journals The isomorphism problem for finitely generated fully residually free groups

2007 ◽  
Vol 208 (3) ◽  
pp. 961-977 ◽  
Author(s):  
Inna Bumagin ◽  
Olga Kharlampovich ◽  
Alexei Miasnikov
Keyword(s):  
Free Groups ◽  
Isomorphism Problem ◽  
Finitely Generated

scholarly journals Groups with many permutable subgroups

1990 ◽  
Vol 48 (3) ◽  
pp. 397-401 ◽  
Author(s):  
Mario Curzio ◽  
John Lennox ◽  
Akbar Rhemtulla ◽  
James Wiegold
Keyword(s):  
Free Groups ◽  
Finitely Generated ◽  
Soluble Groups ◽  
Cyclic Subgroups ◽  
Prove Theorem ◽  
Permutable Subgroups ◽  
Infinite Set ◽  
Torsion Free

AbstractWe consider the influence on a group G of the condition that every infinite set of cyclic subgroups of G contains a pair that permute and prove (Theorem 1) that finitely generated soluble groups with this condition are centre-by-finite, and (Theorem 2) that torsion free groups satisfying the condition are abelian.

Sign in / Sign up

Export Citation Format

Share Document