Direct products and elementary equivalence of polycyclic-by-finite groups

Clement Lasserre; Francis Oger

Home/Archive/arXiv

arXiv · 1309.2490

Direct products and elementary equivalence of polycyclic-by-finite groups

Clement Lasserre·Francis Oger

View original source ↗Read source document ↗Export metadata ↓

Abstract

We give an algebraic characterization of elementary equivalence for polycyclic-by-finite groups. Using this characterization, we investigate the relations between their elementary equivalence and the elementary equivalence of the factors in their decompositions in direct products of indecomposable groups. In particular we prove that the elementary equivalence of two such groups G,H is equivalent to each of the following properties: 1)Gx...xG (k times G) and Hx...xG (k times H) are elementarily equivalent for a strictly positive integer k; 2)AxG and AxH are elementarily equivalent for two elementarily equivalent polycyclic-by-finite groups A,B. It is not presently known if 1) implies elementary equivalence for any groups G,H.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Clement Lasserre, Francis Oger. 2014-08-13. Direct products and elementary equivalence of polycyclic-by-finite groups. https://arxiv.org/abs/1309.2490

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↗