A right-angled Artin group is self-simulable if and only if its defining graph has no disconnecting clique.
Graph groups are biautomatic.Journal of Pure and Applied Algebra, 94(3):341–352, 1994
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Self-simulability of right-angled Artin groups
A right-angled Artin group is self-simulable if and only if its defining graph has no disconnecting clique.