Search arXivSearch

arXiv · 1410.1483

On t-extensions of abelian groups

Abstract

Let G and C be two discrete abelian groups. It is known that Pext(C,G) is a subgroup of Ext(C,G). In this paper, we introduce the t-extensions of G by C. We will show that the set of all t-extensions of G by C is a subgroup of Ext(C,G) which contains Pext(C,G). Fulp and Griffith [4] determined the LCA groups G such that Ext(C,G)=0 for all compact connected groups C. Using the group of t-extensions, we determine the LCA groups G such that Pext(C,G)=0 for all compact connected groups C.

Explore related subjects

Keep this discovery

BibTeXRIS

Hussain Sahleh, Aliakbar Alijani. 2014-10-06. On t-extensions of abelian groups. https://doi.org/10.22034/kjm.2018.74220

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