SearcharxivSearch

arXiv · 2202.10120

Computing a spectral sequence of finite Heisenberg groups of prime power order

Abstract

Let $p\geq 5$ be a prime number, let $n\geq 2$ be a natural number and let $\text{Heis}(p^n)$ denote the Heisenberg group modulo $p^n$. We study the Lyndon-Hochschild-Serre spectral sequence $E(\text{Heis}(p^n))$ associated to $\text{Heis}(p^n)$ considered as a split extension, and show that, $E(\text{Heis}(p^n))$ collapses in the third page. Moreover, for a fixed $p$, the spectral sequences $E(\text{Heis}(p^n))$ are isomorphic from the second page on.

Explore related subjects

Keep this discovery

BibTeXRIS

Oihana Garaialde Ocaña, Lander Guerrero Sánchez. 2022-02-21. Computing a spectral sequence of finite Heisenberg groups of prime power order. https://arxiv.org/abs/2202.10120

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