scholarly journals E-polynomial of SL2(ℂ)-character varieties of free groups

2014 ◽  
Vol 25 (06) ◽  
pp. 1450058 ◽  
Author(s):  
Samuel Cavazos ◽  
Sean Lawton
Keyword(s):  
Finite Field ◽  
Euler Characteristic ◽  
Free Group ◽  
Free Groups ◽  
Singular Locus ◽  
General Algorithm ◽  
Character Variety ◽  
Character Varieties ◽  
First Main Theorem

Let 𝖥r be a free group of rank r, 𝔽q a finite field of order q, and let SL n(𝔽q) act on Hom (𝖥r, SL n(𝔽q)) by conjugation. We describe a general algorithm to determine the cardinality of the set of orbits Hom (𝖥r, SL n(𝔽q))/ SL n(𝔽q). Our first main theorem is the implementation of this algorithm in the case n = 2. As an application, we determine the E-polynomial of the character variety Hom (𝖥r, SL 2(ℂ))// SL 2(ℂ), and of its smooth and singular locus. Thus we determine the Euler characteristic of these spaces.

Toric Geometry ofSL2(ℂ) Free Group Character Varieties from Outer Space

2018 ◽  
Vol 70 (2) ◽  
pp. 354-399 ◽  
Author(s):  
Christopher Manon
Keyword(s):  
Free Group ◽  
Outer Space ◽  
Integrable Hamiltonian System ◽  
Outer Automorphism ◽  
Character Variety ◽  
Toric Geometry ◽  
Character Varieties ◽  
Simplicial Space ◽  
Proper Map ◽  
Divisorial Valuations

AbstractCuller and Vogtmann defined a simplicial spaceO(g), calledouter space, to study the outer automorphism group of the free groupFg. Using representation theoretic methods, we give an embedding ofO(g) into the analytification of X(Fg,SL2(ℂ)), theSL2(ℂ) character variety ofFg, reproving a result of Morgan and Shalen. Then we show that every pointvcontained in a maximal cell ofO(g) defines a flat degeneration of X(Fg,SL2(ℂ)) to a toric varietyX(PΓ). We relate X(Fg,SL2(ℂ)) andX(v) topologically by showing that there is a surjective, continuous, proper map Ξv:X(Fg,SL2(ℂ)) →X(v). We then show that this map is a symplectomorphism on a dense open subset of X(Fg, SL2(ℂ)) with respect to natural symplectic structures on X(Fg, SL2(ℂ)) andX(v). In this way, we construct an integrable Hamiltonian system in X(Fg, SL2(ℂ)) for each point in a maximal cell ofO(g), and we show that eachvdefines a topological decomposition of X(Fg, SL2(ℂ)) derived from the decomposition ofX(PΓ) by its torus orbits. Finally, we show that the valuations coming from the closure of a maximal cell inO(g) all arise as divisorial valuations built from an associated projective compactification of X(Fg, SL2(ℂ)).

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.

Sign in / Sign up

Export Citation Format

Share Document