Graph products of infinite f.g. groups are self-simulable iff their defining graph has no disconnecting clique consisting of amenable groups.
Graph groups are biautomatic.Journal of Pure and Applied Algebra, 94(3):341–352
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
No citing papers match the current filters.