SearcharxivSearch

arXiv · math/0011185

GCH implies the existence of many rigid almost free abelian groups

Abstract

We begin with the existence of groups with trivial duals for cardinals aleph_n (n in omega). Then we derive results about strongly aleph_n-free abelian groups of cardinality aleph_n (n in omega) with prescribed free, countable endomorphism ring. Finally we use combinatorial results of [Sh:108], [Sh:141] to give similar answers for cardinals >aleph_omega. As in Magidor and Shelah [MgSh:204], a paper concerned with the existence of kappa-free, non-free abelian groups of cardinality kappa, the induction argument breaks down at aleph_omega. Recall that aleph_omega is the first singular cardinal and such groups of cardinality aleph_omega do not exist by the well-known Singular Compactness Theorem (see [Sh:52]).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rüdiger Göbel, Saharon Shelah. 2000-11-22. GCH implies the existence of many rigid almost free abelian groups. https://arxiv.org/abs/math/0011185

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