scholarly journals LINEAR ESTIMATES FOR SOLUTIONS OF QUADRATIC EQUATIONS IN FREE GROUPS

2012 ◽  
Vol 22 (01) ◽  
pp. 1250004 ◽  
Author(s):  
OLGA KHARLAMPOVICH ◽  
ALINA VDOVINA

We prove that in a free group the length of the value of each variable in a minimal solution of a standard quadratic equation is bounded by 2s for an orientable equation and by 12s4 for a non-orientable equation, where s is the sum of the lengths of the coefficients.

1949 ◽  
Vol 1 (2) ◽  
pp. 187-190 ◽  
Author(s):  
Marshall Hall

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.


1998 ◽  
Vol 41 (2) ◽  
pp. 325-332 ◽  
Author(s):  
D. Gaboriau ◽  
G. Levitt ◽  
M. Lustig

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.


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

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.


2015 ◽  
Vol 159 (1) ◽  
pp. 89-114 ◽  
Author(s):  
MORITZ RODENHAUSEN ◽  
RICHARD D. WADE

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.


Author(s):  
Christophe Reutenauer

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).


1981 ◽  
Vol 24 (2) ◽  
pp. 129-136 ◽  
Author(s):  
Narain Gupta

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.


2002 ◽  
Vol 54 (1) ◽  
pp. 71-91 ◽  
Author(s):  
Kwok-Kwong Stephen Choi ◽  
Jianya Liu

AbstractLet b1,…,b5 be non-zero integers and n any integer. Suppose that b1 + … + b5 ≡ n (mod 24) and (bi, bj) = 1 for 1 ≤ i < j ≤ 5. In this paper we prove that(i)if all bj are positive and , then the quadratic equation is soluble in primes pj, and(ii)if bj are not all of the same sign, then the above quadratic equation has prime solutions satisfying .


2006 ◽  
Vol 16 (06) ◽  
pp. 1031-1045 ◽  
Author(s):  
NICHOLAS W. M. TOUIKAN

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.


2005 ◽  
Vol 14 (08) ◽  
pp. 1087-1098 ◽  
Author(s):  
VALERIJ G. BARDAKOV

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