SearcharxivSearch

arXiv · 2106.03782

On the elementary theory of graph products of groups

Abstract

In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we require the vertex groups to satisfy a non-generic almost positive sentence, a condition which generalizes a range of natural ``non-freeness conditions" such as the satisfaction of a group law, having nontrivial center or being boundedly simple. As a corollary, we determine an invariant of the elementary theory of a right-angled Artin group, the core of the defining graph, which we conjecture to determine the elementary class of the RAAG. We further combine our results with the results of Sela on free products of groups to describe all finitely generated groups elementarily equivalent to certain RAAGs. We also deduce rigidity results on the elementary classification of graph products of groups for specific types of vertex groups, such as finite, nilpotent or classical linear groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Montserrat Casals-Ruiz, Ilya Kazachkov, Javier de la Nuez González. 2021-06-07. On the elementary theory of graph products of groups. https://arxiv.org/abs/2106.03782

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