scholarly journals Non-cancellative power-free groups

1966 ◽  
Vol 7 (4) ◽  
pp. 207-212
Author(s):  
R. G. Walker
Keyword(s):  
Free Group ◽  
Algebraic System ◽  
Complete Solution ◽  
Free Groups

A. Geddes [1, Theorem 3.3] has shown that the partial algebraic system which he has called a power-free group need not be cancellative. In other words, there exist power-free groups containing at least one element a with the property that ab can equal ac when b ≠ c. In the present paper we propose to study the structure of such non-cancellative power-free groups, and we shall in fact obtain a complete solution to this problem.

scholarly journals The structure of cancellative power-free groups

1966 ◽  
Vol 7 (4) ◽  
pp. 199-206 ◽  
Author(s):  
A. Geddes ◽  
R. G. Walker
Keyword(s):  
Free Group ◽  
Algebraic System ◽  
Free Groups ◽  
Definition Of

The definition of a power-free group will be found in [1]. It is a partial algebraic system which, roughly speaking, may be thought of as a group in which (with the exception of the identity) squares and higher powers of an element are not defined.It has been shown [1, Theorem 3.3] that the usual cancellation laws need not hold in a power-free group. When these laws do hold, the power-free group is called cancellative. In this paper we shall be solely concerned with cancellative power-free groups and the term ‘power-free group’ is to be understood to mean ‘cancellative power-free group’.

Subgroups of Finite Index in Free Groups

1949 ◽  
Vol 1 (2) ◽  
pp. 187-190 ◽  
Author(s):  
Marshall Hall
Keyword(s):  
Free Group ◽  
Finite Index ◽  
Free Groups ◽  
Recursion Formula ◽  
Independent Interest ◽  
Finiteness Conditions ◽  
Total Length ◽  
Free Generators

This paper has as its chief aim the establishment of two formulae associated with subgroups of finite index in free groups. The first of these (Theorem 3.1) gives an expression for the total length of the free generators of a subgroup U of the free group Fr with r generators. The second (Theorem 5.2) gives a recursion formula for calculating the number of distinct subgroups of index n in Fr.Of some independent interest are two theorems used which do not involve any finiteness conditions. These are concerned with ways of determining a subgroup U of F.

scholarly journals A dendrological proof of the Scott conjecture for automorphisms of free groups

1998 ◽  
Vol 41 (2) ◽  
pp. 325-332 ◽  
Author(s):  
D. Gaboriau ◽  
G. Levitt ◽  
M. Lustig
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Alternative Proof ◽  
Automorphisms Of Free Groups

Let α be an automorphism of a free group of rank n. The Scott conjecture, proved by Bestvina-Handel, asserts that the fixed subgroup of α has rank at most n. We give a short alternative proof of this result using R-trees.

scholarly journals On a Nonsingular Equation of Length 9 Over Torsion Free Groups

2019 ◽  
Vol 12 (2) ◽  
pp. 590-604
Author(s):  
M. Fazeel Anwar ◽  
Mairaj Bibi ◽  
Muhammad Saeed Akram
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Torsion Free Group ◽  
Torsion Free

In \cite{levin}, Levin conjectured that every equation is solvable over a torsion free group. In this paper we consider a nonsingular equation $g_{1}tg_{2}t g_{3}t g_{4} t g_{5} t g_{6} t^{-1} g_{7} t g_{8}t \\ g_{9}t^{-1} = 1$ of length $9$ and show that it is solvable over torsion free groups modulo some exceptional cases.

scholarly journals Centralisers of Dehn twist automorphisms of free groups

2015 ◽  
Vol 159 (1) ◽  
pp. 89-114 ◽  
Author(s):  
MORITZ RODENHAUSEN ◽  
RICHARD D. WADE
Keyword(s):  
Free Group ◽  
Finite Index ◽  
Free Groups ◽  
Dehn Twist ◽  
Classifying Space ◽  
Dehn Twists ◽  
Automorphisms Of Free Groups

AbstractWe refine Cohen and Lustig's description of centralisers of Dehn twists of free groups. We show that the centraliser of a Dehn twist of a free group has a subgroup of finite index that has a finite classifying space. We describe an algorithm to find a presentation of the centraliser. We use this algorithm to give an explicit presentation for the centraliser of a Nielsen automorphism in Aut(Fn). This gives restrictions to actions of Aut(Fn) on CAT(0) spaces.

Basics

2018 ◽  
pp. 7-8
Author(s):  
Christophe Reutenauer
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Free Monoid ◽  
Periodic Pattern ◽  
Infinite Words ◽  
Reduced Words

Definitions and basic results about words: alphabet, length, free monoid, concatenation, prefix, suffix, factor, conjugation, reversal, palindrome, commutative image, periodicity, ultimate periodicity, periodic pattern, infinite words, bi-infinite words, free groups, reduced words, homomorphisms, embedding of a free monoid in a free group, abelianization,matrix of an endomorphism, GL2(Z), SL2(Z).

A Problem of R. H. Fox

1981 ◽  
Vol 24 (2) ◽  
pp. 129-136 ◽  
Author(s):  
Narain Gupta
Keyword(s):  
Free Group ◽  
Free Groups ◽  
Group Rings ◽  
Normal Subgroups ◽  
Infinite Groups ◽  
Expository Article

The purpose of this expository article is to familiarize the reader with one of the fundamental problems in the theory of infinite groups. We give an up-to-date account of the so-called Fox problem which concerns the identification of certain normal subgroups of free groups arising out of certain ideals in the free group rings. We assume that the reader is familiar with the elementary concepts of algebra.

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 EXTENDING REPRESENTATIONS OF BRAID GROUPS TO THE AUTOMORPHISM GROUPS OF FREE GROUPS

2005 ◽  
Vol 14 (08) ◽  
pp. 1087-1098 ◽  
Author(s):  
VALERIJ G. BARDAKOV
Keyword(s):  
Free Group ◽  
Braid Group ◽  
Automorphism Groups ◽  
Free Groups ◽  
Linear Representation ◽  
Braid Groups ◽  
Burau Representation ◽  
Pure Braid Group

We construct a linear representation of the group IA (Fn) of IA-automorphisms of a free group Fn, an extension of the Gassner representation of the pure braid group Pn. Although the problem of faithfulness of the Gassner representation is still open for n > 3, we prove that the restriction of our representation to the group of basis conjugating automorphisms Cbn contains a non-trivial kernel even if n = 2. We construct also an extension of the Burau representation to the group of conjugating automorphisms Cn. This representation is not faithful for n ≥ 2.

Sign in / Sign up

Export Citation Format

Share Document