SearcharxivSearch

arXiv · 1609.03026

Primitive pairs of K-groups

Abstract

In 'Primitive pairs of $p$-solvable groups', J. Algebra 324 (2010) 841-859, the author proved a non existence theorem for certain types of amalgams of $p$-solvable groups in the presence of operator groups acting coprimely on the groups in the amalgam. An application of that work was a new proof of the Solvable Signalizer Functor Theorem. In this article, the $p$-solvable restriction will be weakened to a $K$-group hypothesis. An application of this work will be a new proof of the Nonsolvable Signalizer Functor Theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Flavell. 2016-09-10. Primitive pairs of K-groups. https://arxiv.org/abs/1609.03026

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