Search arXivSearch

arXiv · 2308.13635

Letter-braiding: bridging combinatorial group theory and topology

Abstract

We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide with coefficients in the Magnus expansion. In contrast with Magnus' coefficients, our invariants are defined on all groups and over any PID. They respect products in the group and are a complete invariant of the dimension series, so they are the coefficients of a universal multiplicative finite-type invariant, depending functorially on the group. Letter-braiding invariants arise from the bar construction on a cochain model of a space with a prescribed fundamental group. This approach specializes to simplicial presentations of a group as well as to more geometric contexts, which we illustrate in examples. As an application, we define variants of the Johnson filtration and the Johnson homomorphism on the automorphisms of arbitrary groups, and use them to constrain automorphisms of finite p-groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Nir Gadish. 2023-08-25. Letter-braiding: bridging combinatorial group theory and topology. https://arxiv.org/abs/2308.13635

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

KEEP EXPLORING

Related papers

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

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

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