SearcharxivSearch

arXiv · 2103.04575

Elementary equivalence of Kac-Moody groups

Abstract

The paper is devoted to model-theoretic properties of Kac-Moody groups with the focus on elementary equivalence of Kac-Moody groups. We show that elementary equivalence of (untwisted) affine Kac-Moody groups implies coincidence of their generalized Cartan matrices and the elementary equivalence of their ground fields. We also show that elementary equivalence of arbitrary Kac-Moody groups over finite fields implies coincidence of these fields and an isomorphism of their twin root data. The similar result is established for Kac-Moody groups defined over infinite subfields of the algebraic closures of finite fields.

Explore related subjects

Keep this discovery

BibTeXRIS

Jun Morita, Eugene Plotkin. 2021-03-08. Elementary equivalence of Kac-Moody groups. https://arxiv.org/abs/2103.04575

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