Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2204.12469

The Image of the Gassner Representation of the Pure Braid Subgroup has Pairwise Free Generators

G. Makenzie Cosgrove
View original source ↗Read source document ↗Export metadata ↓

Abstract

While much is known about the faithfulness of the Burau representation, the problem remains open for the Gassner representation for every $B_n$ with $n\geq 4$. We first find the definition of the Colored-Burau representation of Ainshel, Ainshel, Goldfeld, and Lemieux and we show that this is equivalent, when restricted to the pure braid subgroup, to the Gassner representation. The methods of Abdulrahim and Knudson require analysis within the lower central series of a free subgroup of the pure braid group. However, Lipschutz's work gives a method for analyzing the Gassner representation and the Colored-Burau structure reduces this analysis to basic linear algebra.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

G. Makenzie Cosgrove. 2022-04-26. The Image of the Gassner Representation of the Pure Braid Subgroup has Pairwise Free Generators. https://arxiv.org/abs/2204.12469

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗