Self-simulability of right-angled Artin groups

TL;DR

This paper characterizes when right-angled Artin groups are self-simulable based on their defining graph's properties, linking algebraic structure to tiling constraints.

Contribution

It provides a complete characterization of self-simulability for RAAGs and explores partial results for general graph products.

Findings

RAAGs are self-simulable iff their defining graph has no disconnecting clique.

Established a criterion connecting graph properties to group self-simulability.

Extended analysis to partial cases of general graph products.

Abstract

A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a RAAG is self-simulable if and only if its defining graph has no disconnecting clique, and also prove partial results on self-simulability of general graph products.