From Subdirect Sums to Virtuality

Stephanos Gekas

Home/Archive/arXiv

arXiv · 1509.03245

From Subdirect Sums to Virtuality

Stephanos Gekas

View original source ↗Read source document ↗Export metadata ↓

Abstract

We start by an original investigation on subgroups of (even infinite) direct sums in the first 4 sections, that largely generalizes Remak's known theorem; inspired by that general picture we have elsewhere extended this elementary "virtual" diagrammatic situation (in diagrammatic length 2 meaning set-theoretic fixation of vertices) by generalizing to the notion of "virtuality" in module extensions and diagrams in modular representation theory. Our first approach starts with an appropriately defined equivalence relation, which is precisely what allows for treating the confusing case of multiple factors, thus giving a deeper insight into the structure of such subgroups. Several applications and new techniques arising from that approach are examined, even ones concerning basic properties of homomorphisms, extending well-known elementary ones.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Stephanos Gekas. 2015-09-10. From Subdirect Sums to Virtuality. https://arxiv.org/abs/1509.03245

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↗