Twisted Droms Theorem for T-RAAGs

• Twisted Droms Theorem is a criterion establishing that every finitely generated subgroup of a twisted right-angled Artin group is itself a T-RAAG if and only if its defining mixed graph is a Droms mixed graph.
• It extends Droms' classical results by preserving coherence through chordality of the underlying simplicial graph while incorporating new mixed-graph obstructions like sinkholes, satellites, and the exclusion of Λs.
• The theorem constructs T-RAAGs recursively using operations like free products, cones with induced signatures, and semidirect products, which also aids in addressing rigidity and the isomorphism problem in these groups.

The Twisted Droms Theorem, in the sense formalized for twisted right-angled Artin groups, characterizes exactly which twisted right-angled Artin groups are closed under taking finitely generated subgroups: for a mixed graph $\Gamma$ and its twisted right-angled Artin group $T(\Gamma)$, every finitely generated subgroup of $T(\Gamma)$ is again a twisted right-angled Artin group if and only if $\Gamma$ is a Droms mixed graph (Blumer et al., 29 Apr 2025). This extends Droms’ classical 1987 subgroup theorem for right-angled Artin groups (RAAGs), preserves the classical chordality criterion for coherence, and yields a rigidity theory for defining mixed graphs in a substantial subclass through the notions of sinkholes, satellites, abelianization, and cone decompositions (Blumer et al., 29 Apr 2025).

1. Classical Droms background

The classical point of departure is the RAAG attached to a finite simplicial graph $\bar\Gamma=(V,E)$,

$$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$

where $[x,y]=xyx^{-1}y^{-1}$. In this presentation, adjacency in $\bar\Gamma$ records commutation and nothing else. The foundational results of Droms identify graph-theoretic conditions governing subgroup closure and coherence for this class (Blumer et al., 29 Apr 2025).

Droms’ subgroup theorem states that, for a RAAG $A(\bar\Gamma)$, the following are equivalent: every finitely generated subgroup of $A(\bar\Gamma)$ is again a RAAG, and $T(\Gamma)$0 contains neither the path $T(\Gamma)$1 on four vertices nor the $T(\Gamma)$2-cycle $T(\Gamma)$3 as an induced subgraph. Graphs satisfying this forbidden-subgraph condition are called Droms simplicial graphs. Droms also proved that $T(\Gamma)$4 is coherent if and only if $T(\Gamma)$5 is chordal, meaning that $T(\Gamma)$6 has no induced cycles of length at least $T(\Gamma)$7 (Blumer et al., 29 Apr 2025).

These two theorems provide the exact baseline for the twisted theory. In the untwisted setting, subgroup-closedness is controlled by forbidding induced $T(\Gamma)$8 and $T(\Gamma)$9, whereas coherence is controlled by chordality. The twisted theory retains the second criterion unchanged, but the first requires genuinely new mixed-graph obstructions (Blumer et al., 29 Apr 2025).

2. Mixed graphs and twisted right-angled Artin groups

The twisted theory is formulated on a mixed graph $T(\Gamma)$0, consisting of a simplicial graph $T(\Gamma)$1 together with a distinguished subset $T(\Gamma)$2 of directed edges and maps $T(\Gamma)$3 assigning origin and terminus. An undirected edge $T(\Gamma)$4 is denoted $T(\Gamma)$5, while a directed edge $T(\Gamma)$6 with origin $T(\Gamma)$7 and terminus $T(\Gamma)$8 is denoted $T(\Gamma)$9 (Blumer et al., 29 Apr 2025).

A vertex is negative if it occurs as the terminus of some directed edge. A sinkhole is a vertex $\Gamma$0 such that every edge incident to $\Gamma$1 points into $\Gamma$2. A signature is a map $\Gamma$3 such that $\Gamma$4 for every negative vertex $\Gamma$5, and $\Gamma$6 for every non-isolated vertex that is not the terminus of a directed edge; isolated vertices may be assigned either sign. A mixed graph is special if every negative vertex is a sinkhole; equivalently, it avoids the three minimal non-special induced subgraphs listed in equations (1.1)–(1.3) of the paper (Blumer et al., 29 Apr 2025).

The associated twisted right-angled Artin group is

$\Gamma$7

The relations $\Gamma$8 are referred to as Klein relations and encode the twist carried by directed edges. When $\Gamma$9, the construction reduces to the RAAG on the underlying simplicial graph $\bar\Gamma=(V,E)$0, so $\bar\Gamma=(V,E)$1 (Blumer et al., 29 Apr 2025).

Several structural maps are fundamental. If $\bar\Gamma=(V,E)$2 is an induced subgraph of $\bar\Gamma=(V,E)$3, then the natural map $\bar\Gamma=(V,E)$4 is injective. The underlying RAAG $\bar\Gamma=(V,E)$5 also injects into $\bar\Gamma=(V,E)$6 via the squaring map $\bar\Gamma=(V,E)$7. More generally, if $\bar\Gamma=(V,E)$8 is obtained by turning all directed edges $\bar\Gamma=(V,E)$9 into undirected edges $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$0, then the map $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$1 sending $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$2 and fixing the remaining generators is injective (Blumer et al., 29 Apr 2025).

The abelianization provides a coarse but powerful invariant:

$$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$3

where $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$4 is the number of vertices serving as origins of directed edges. This decomposition is repeatedly used to recover directed structure and to distinguish non-isomorphic mixed graphs that could otherwise have closely related subgroup structure (Blumer et al., 29 Apr 2025).

A further essential operation is the cone. Given a mixed graph $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$5 and a signature $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$6, the cone $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$7 adjoins a new vertex $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$8 adjacent to every existing vertex, with $$A(\bar\Gamma)=\langle V \mid [v_i,v_j]=1 \text{ whenever } \{i,j\}\in E\rangle,$$9 directed precisely when $[x,y]=xyx^{-1}y^{-1}$0 is negative. Algebraically,

$[x,y]=xyx^{-1}y^{-1}$1

with

$[x,y]=xyx^{-1}y^{-1}$2

Iterating this construction yields towers of semidirect products over $[x,y]=xyx^{-1}y^{-1}$3 (Blumer et al., 29 Apr 2025).

3. Statement of the theorem and constructive content

The decisive mixed-graph notion is that of a Droms mixed graph. Such a graph $[x,y]=xyx^{-1}y^{-1}$4 must satisfy three conditions: it is special; its underlying simplicial graph $[x,y]=xyx^{-1}y^{-1}$5 is a Droms simplicial graph, so it has no induced $[x,y]=xyx^{-1}y^{-1}$6 and no induced $[x,y]=xyx^{-1}y^{-1}$7; and it contains no induced copy of the special mixed graph $[x,y]=xyx^{-1}y^{-1}$8, consisting of three vertices $[x,y]=xyx^{-1}y^{-1}$9 with directed edges $\bar\Gamma$0 and $\bar\Gamma$1 and no edge between $\bar\Gamma$2 and $\bar\Gamma$3 (Blumer et al., 29 Apr 2025).

The Twisted Droms Theorem states that for $\bar\Gamma$4 the following are equivalent: every finitely generated subgroup of $\bar\Gamma$5 is again a twisted right-angled Artin group; and $\bar\Gamma$6 is a Droms mixed graph (Blumer et al., 29 Apr 2025).

The theorem is not merely the classical RAAG criterion with orientations appended. A common oversimplification is to retain only the forbidden induced subgraphs $\bar\Gamma$7 and $\bar\Gamma$8 from the untwisted setting. In the twisted setting this is insufficient: non-special mixed graphs already fail subgroup-closure, and even among special graphs one must exclude the additional obstruction $\bar\Gamma$9 (Blumer et al., 29 Apr 2025).

Its constructive content is encoded by a recursion on induced subgraphs. A mixed graph is Droms mixed if and only if every induced subgraph is either a disjoint union of two non-empty proper subgraphs or a cone $A(\bar\Gamma)$0 for some induced subgraph $A(\bar\Gamma)$1 and signature $A(\bar\Gamma)$2. Consequently, $A(\bar\Gamma)$3 is an elementary T-RAAG, built recursively from infinite cyclic groups by free products and semidirect products with $A(\bar\Gamma)$4 determined by signatures (Blumer et al., 29 Apr 2025).

The proof splits along the two implications. For subgroup-closedness, the recursion is combined with closure under free products and cones. Kurosh theory controls finitely generated subgroups of free products, while in the coned case one projects a subgroup $A(\bar\Gamma)$5 to $A(\bar\Gamma)$6, lifts the projection by a section of the form $A(\bar\Gamma)$7, and reconstructs $A(\bar\Gamma)$8 as a semidirect product with induced signature. For the converse, the paper proceeds contrapositively through “poisonous” induced subgraphs: if $A(\bar\Gamma)$9 contains $A(\bar\Gamma)$0 or $A(\bar\Gamma)$1, then the corresponding RAAGs inject into $A(\bar\Gamma)$2 via squaring, and Droms’ classical non-RAAG finitely generated subgroups survive as obstructions; if $A(\bar\Gamma)$3 is not special, or if $A(\bar\Gamma)$4 occurs, explicit finitely generated subgroups such as $A(\bar\Gamma)$5 have subgroup structure incompatible with any T-RAAG on two vertices (Blumer et al., 29 Apr 2025).

The examples in the introduction sharpen necessity. The graph $A(\bar\Gamma)$6 is special, has Droms underlying graph, and avoids $A(\bar\Gamma)$7; correspondingly, $A(\bar\Gamma)$8 is subgroup-closed and admits the form $A(\bar\Gamma)$9. By contrast, $T(\Gamma)$00 fails the $T(\Gamma)$01 condition, while $T(\Gamma)$02 and $T(\Gamma)$03 are not special, and all three fail subgroup-closure (Blumer et al., 29 Apr 2025).

4. Coherence and the persistence of chordality

For T-RAAGs, coherence is classified exactly as in the RAAG case: $T(\Gamma)$04 is coherent if and only if the underlying simplicial graph $T(\Gamma)$05 is chordal (Blumer et al., 29 Apr 2025). This is one of the most striking formal parallels between the twisted and untwisted settings.

The non-chordal direction is reduced immediately to the classical RAAG obstruction. If $T(\Gamma)$06 is not chordal, then $T(\Gamma)$07 is non-coherent by Droms’ theorem, and the injective squaring map $T(\Gamma)$08 transfers this non-coherence to $T(\Gamma)$09. Twisting therefore does not remove the classical pathologies created by induced cycles of length at least $T(\Gamma)$10 (Blumer et al., 29 Apr 2025).

The chordal direction is proved by decomposition along complete subgraphs. One writes

$T(\Gamma)$11

where $T(\Gamma)$12 is complete and $T(\Gamma)$13 is virtually $T(\Gamma)$14, because complete mixed graphs produce virtually free abelian T-RAAGs. Induction together with the Karrass–Solitar coherence lemma yields coherence of the amalgamated product. The role of the twist is therefore absorbed into the algebra of the complete pieces, while the global criterion remains purely a property of $T(\Gamma)$15 (Blumer et al., 29 Apr 2025).

This yields a clean taxonomy. Complete mixed graphs, trees, and cones over chordal bases are coherent. Any mixed graph whose underlying simplicial graph contains $T(\Gamma)$16 for $T(\Gamma)$17 or $T(\Gamma)$18 is non-coherent. The resulting principle is that subgroup-closedness is sensitive to the directed structure, whereas coherence is governed entirely by the untwisted chordality of the underlying graph (Blumer et al., 29 Apr 2025).

5. Rigidity, satellites, and the isomorphism problem

The same paper also addresses rigidity for a notable subclass of T-RAAGs, that is, whether the abstract isomorphism type of $T(\Gamma)$19 determines the defining mixed graph $T(\Gamma)$20. The key obstruction is the notion of a satellite. In a special mixed graph, a vertex $T(\Gamma)$21 is a satellite of a sinkhole $T(\Gamma)$22 if $T(\Gamma)$23 is not adjacent to $T(\Gamma)$24, some third vertex is joined to both, and every neighbor of $T(\Gamma)$25 is also a neighbor of $T(\Gamma)$26 (Blumer et al., 29 Apr 2025).

The rigidity theorem has three parts. First, if a special graph $T(\Gamma)$27 is rigid, then it has no satellites. Second, if $T(\Gamma)$28 has a sinkhole joined to every other vertex, then $T(\Gamma)$29 is rigid. Third, in the Droms mixed subclass, rigidity is equivalent to the absence of satellites. Hence, for Droms mixed graphs, the isomorphism class of $T(\Gamma)$30 determines $T(\Gamma)$31 exactly when satellites are absent (Blumer et al., 29 Apr 2025).

The proof uses two group-theoretic invariants in a decisive way. The first is the abelianization

$T(\Gamma)$32

whose $T(\Gamma)$33-torsion rank records the number of origins of directed edges and constrains the possible sinkhole pattern. The second is the maximal abelian normal subgroup $T(\Gamma)$34 in the connected Droms case. The paper shows that $T(\Gamma)$35 is unique and arises from “central” vertices joined to all others: either $T(\Gamma)$36 when all cone tips are positive, or $T(\Gamma)$37 when there is a unique negative central vertex $T(\Gamma)$38. In either case $T(\Gamma)$39 is obtained by $T(\Gamma)$40 iterated conings over an induced subgraph $T(\Gamma)$41, and $T(\Gamma)$42, so the cone layers are visible from the group alone (Blumer et al., 29 Apr 2025).

The non-rigid direction is realized by explicit graph surgery. If a positive satellite $T(\Gamma)$43 of a sinkhole $T(\Gamma)$44 exists, one can construct a distinct mixed graph $T(\Gamma)$45 by turning $T(\Gamma)$46 into a sinkhole $T(\Gamma)$47 while preserving the isomorphism type of the group. This shows that satellites are genuine obstructions rather than merely combinatorial nuisances. Conversely, when a sinkhole is joined to all vertices, projection onto the cyclic factor generated by that sinkhole, together with underlying RAAG rigidity, forces coincidence of defining graphs (Blumer et al., 29 Apr 2025).

The resulting decision procedure is graph-theoretic rather than presentation-theoretic. In the Droms case, one verifies specialness, checks for satellites around sinkholes, and concludes rigidity exactly when no satellites occur. The examples recorded in the paper reflect each possibility: $T(\Gamma)$48 is Droms but not rigid because $T(\Gamma)$49 and $T(\Gamma)$50 are satellites of each other; $T(\Gamma)$51 and $T(\Gamma)$52 are special with a sinkhole joined to all vertices and are therefore rigid; the example $T(\Gamma)$53 is Droms with no satellites and is rigid (Blumer et al., 29 Apr 2025).

6. Related usages, scope, and limitations

The phrase “Twisted Droms Theorem” is used in recent arXiv literature in more than one setting. The mixed-graph theorem for T-RAAGs is the direct theorem bearing that name in the title (Blumer et al., 29 Apr 2025), but closely related “Droms-type” classification phenomena also appear for Coxeter systems and for subdirect products of limit groups over Droms RAAGs (Huang et al., 2017, Kochloukova et al., 2021).

Setting	Core statement	arXiv id
Twisted right-angled Artin groups	Finitely generated subgroup-closure is equivalent to $T(\Gamma)$54 being a Droms mixed graph	(Blumer et al., 29 Apr 2025)
Coxeter systems of type FC with only $T(\Gamma)$55 twists	Angle-compatible Coxeter generating sets differ by elementary twists and conjugation; under these hypotheses the defining graph is unchanged	(Huang et al., 2017)
Full subdirect products of limit groups over Droms RAAGs	Type $T(\Gamma)$56 implies virtual surjection onto every $T(\Gamma)$57-tuple of coordinates	(Kochloukova et al., 2021)

In the Coxeter-group usage, the relevant background is Mühlherr’s Twist Conjecture. Under the assumptions that the defining graph is of type FC and admits only twists in $T(\Gamma)$58, angle-compatible Coxeter generating sets are related by elementary twists and conjugation; because $T(\Gamma)$59-twists do not change the defining graph, one obtains a strong rigidity phenomenon analogous to Droms’ theorem for RAAGs (Huang et al., 2017). In the limit-group usage, the phrase is analogical rather than official: the paper does not itself use the term, but its main theorem is presented as a twisted analogue of Droms’ subgroup theorem, replacing subgroup closure by a virtual-surjection theorem for full subdirect products of type $T(\Gamma)$60 (Kochloukova et al., 2021).

Within the T-RAAG setting proper, the main scope and limitations are explicit. The theorem extends Droms’ subgroup-closure criterion by replacing the sole obstruction pair $T(\Gamma)$61 with the mixed-graph package of specialness, Droms underlying graph, and exclusion of $T(\Gamma)$62. It preserves the RAAG coherence classification exactly through chordality of the underlying simplicial graph. It further solves the isomorphism problem for the notable subclass of Droms mixed graphs via the satellite criterion, abelianization, and cone-layer analysis (Blumer et al., 29 Apr 2025).

At the same time, the theory is not complete outside the special and Droms subclasses. Rigidity may fail beyond these classes, and the paper records the conjectural expectation that satellites characterize rigidity for all special graphs. No complexity bounds are given for the decision procedures, which remain structural and graph-theoretic rather than algorithms from arbitrary group presentations. Finally, the twisted setting introduces Klein relations and torsion phenomena absent from RAAGs, even though subgroup-closure and coherence continue to mirror the classical Droms theorems with remarkable fidelity (Blumer et al., 29 Apr 2025).