SearcharxivSearch

arXiv · 2410.11098

Elementary equivalence of endomorphism rings and automorphism groups of periodic Abelian groups

Abstract

In this paper, we prove that the endomorphism rings End A and End A' of periodic infinite Abelian groups A and A' are elementarily equivalent if and only if the endomorphism rings of their p-components are elementarily equivalent for all primes p. Additionally, we show that the automorphism groups Aut A and Aut A' of periodic Abelian groups A and A' that do not have 2-components and do not contain cocyclic p-components are elementarily equivalent if and only if, for any prime p, the corresponding p-components A_p and A_p' of A and A' are equivalent in second-order logic if they are not reduced, and are equivalent in second-order logic bounded by the cardinalities of their basic subgroups if they are reduced. For such groups A and A', their automorphism groups are elementarily equivalent if and only if their endomorphism rings are elementarily equivalent, and the automorphism groups of the corresponding p-components for all primes p are elementarily equivalent.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elena Bunina. 2024-10-14. Elementary equivalence of endomorphism rings and automorphism groups of periodic Abelian groups. https://arxiv.org/abs/2410.11098

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