SearcharxivSearch

arXiv · 1602.04273

Pure virtual braids, resonance, and formality

Abstract

We investigate the resonance varieties, lower central series ranks, and Chen ranks of the pure virtual braid groups and their upper-triangular subgroups. As an application, we give a complete answer to the 1-formality question for this class of groups. In the process, we explore various connections between the Alexander-type invariants of a finitely generated group and several of the graded Lie algebras associated to it, and discuss possible extensions of the resonance-Chen ranks formula in this context.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander I. Suciu, He Wang. 2016-10-13. Pure virtual braids, resonance, and formality. https://doi.org/10.1007/s00209-016-1811-x

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