Narain Gupta's three normal subgroup problem and group homology

Roman Mikhailov; Inder Bir S. Passi

Home/Archive/arXiv

arXiv · 1611.01313

Narain Gupta's three normal subgroup problem and group homology

Roman Mikhailov·Inder Bir S. Passi

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper is about application of various homological methods to classical problems in the theory of group rings. It is shown that the third homology of groups plays a key role in Narain Gupta's three normal subgroup problem. For a free group $F$ and its normal subgroups $R,\,S,\,T,$ and the corresponding ideals in the integral group ring $\mathbb Z[F]$, ${\bf r}=(R-1)\mathbb Z[F],\ {\bf s}=(S-1)\mathbb Z[F],\ {\bf t}=(T-1)\mathbb Z[F],$ a complete description of the normal subgroup $F\cap (1+{\bf rst})$ is given, provided $R\subseteq T$ and the third and the fourth homology groups of $R/R\cap S$ are torsion groups.

Explore related subjects

math.GR math.KT

Keep this discovery

BibTeX RIS

Roman Mikhailov, Inder Bir S. Passi. 2016-11-04. Narain Gupta's three normal subgroup problem and group homology. https://arxiv.org/abs/1611.01313

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↗