Algebraic and measurable embeddings between square-free right-angled Artin groups
math.GR
Submitted: 2026-09-14
Updated: 2026-10-28
Comments: Added Theorem 1.2
License: http://creativecommons.org/licenses/by/4.0/
The gist: Let Γ,Δ be finite simplicial graphs, and assume that Γ has no induced squares.
Terminology
Abstract
Let Γ,Δ be finite simplicial graphs, and assume that Γ has no induced squares. We prove that the right-angled Artin group A(Δ) measurably embeds into A(Γ) if and only if A(Δ) embeds as a subgroup in a graph product of free abelian groups over Γ. This in turn has a graph-theoretical characterisation which can be checked algorithmically. If additionally A(Γ) and A(Δ) have cohomological dimension equal to two and A(Γ) is not isomorphic to Z times F n, we get that A(Δ) measurably embeds into A(Γ) if and only if it embeds as a subgroup in A(Γ). Our proof relies on the following algebraic statement. Let K 1,,K n be a family of pairwise disjoint cliques in the square-free graph Γ, and let g 1,,g n be elements of A(Γ) with respective parabolic supports A(K 1),,A(K n). Then the subgroup of A(Γ) generated by g 1,,g n is a right-angled Artin group, where the only relations impose that g i and g j commute if K i K j is contained in a clique of Γ. The same holds true more generally for pairwise disjoint cliques K 1,,K n in the extension graph Γ ext, up to possibly replacing the elements g i by powers.
Sources
- Quasiisometric embeddings between right-angled Artin groups: flexibility
- Quasiisometric embeddings between right-angled Artin groups: rigidity
- Graph products and measure equivalence: classification, rigidity, and quantitative aspects
- Embedding problem between right-angled Artin groups
- Measure equivalence rigidity of $\mathrm{Out}(F_N)$
Related papers
- Idempotence criteria for lazy cellular automata
- From algebraic orthogonality to RAAG embedding obstructions in hierarchically hyperbolic groups
- A finitely generated Linear group without property (T) that is neither inner amenable nor properly proximal
- On the Order of Products of Coprime Elements in Finite Groups
- Word length, Morse theory, and Vietoris-Rips complexes
- From almost tight p-group enumeration to 2-group domination among finite groups