Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2212.07111

Conjugacy languages in virtual graph products

Gemma Crowe
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we study the behaviour of conjugacy languages in virtual graph products, extending results by Ciobanu, Hermiller, Holt and Rees. We focus primarily on virtual graph products in the form of a semi-direct product. First, we study the behaviour of twisted conjugacy representatives in right-angled Artin and Coxeter groups. We prove regularity of the conjugacy geodesic language for virtual graph products in certain cases, and highlight properties of the spherical conjugacy language, depending on the automorphism and ordering on the generating set. Finally, we give a criterion for when the spherical conjugacy language is not unambiguous context-free for virtual graph products. We can extend this further in the case of virtual RAAGs, to show the spherical conjugacy language is not context-free.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Gemma Crowe. 2022-12-14. Conjugacy languages in virtual graph products. https://doi.org/10.1016/j.jalgebra.2023.06.029

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↗