pith. sign in

arxiv: 2605.20945 · v1 · pith:LWC33RVSnew · submitted 2026-05-20 · 🧮 math.GR · math.DS

Self-simulability of right-angled Artin groups

Kan\'eda Blot , Ville Salo This is my paper

Pith reviewed 2026-05-21 02:04 UTC · model grok-4.3

classification 🧮 math.GR math.DS
keywords right-angled Artin groupsself-simulabilitySFT coversdefining graphdisconnecting cliquegraph productsgroup actions
0
0 comments X

The pith

Right-angled Artin groups are self-simulable if and only if their defining graphs have no disconnecting clique.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that right-angled Artin groups have a property called self-simulability exactly when their defining graphs lack disconnecting cliques. Self-simulability means that all computable actions of the group can be covered by shifts of finite type, meaning they can be implemented using only finitely many local rules like those in tiling problems. This matters because it gives a simple graph-based test for when a group's actions can be modeled concretely with symbolic dynamics and constraints. Readers interested in group theory and computability would see how algebraic structures translate to dynamical ones through this classification.

Core claim

A right-angled Artin group is self-simulable if and only if its defining graph has no disconnecting clique. Partial results are also given for self-simulability of general graph products.

What carries the argument

The defining graph of the right-angled Artin group and the notion of a disconnecting clique in it, which decides whether every computable action admits an SFT cover.

If this is right

  • Right-angled Artin groups with disconnecting cliques in their graphs are not self-simulable.
  • Self-simulability of these groups reduces to checking a graph property.
  • Some graph products also satisfy related self-simulability conditions.
  • Computable actions of qualifying groups can be realized using finite tiling constraints.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This result may extend the understanding of self-simulability to other group classes defined by graphs.
  • Disconnecting cliques could correspond to some independence in actions that prevents simulation by local rules.
  • Testing specific graphs with and without such cliques could verify the boundary cases.
  • Connections to computability in group actions might be explored further in symbolic dynamics.

Load-bearing premise

The equivalence relies on the specific definition of self-simulability as all computable actions admitting SFT covers and on the standard way right-angled Artin groups are built from graphs including the disconnecting clique concept.

What would settle it

A counterexample would be a computable action of a right-angled Artin group whose defining graph contains a disconnecting clique, yet that action has no SFT cover.

Figures

Figures reproduced from arXiv: 2605.20945 by Kan\'eda Blot, Ville Salo.

Figure 1
Figure 1. Figure 1: Examples of applying Theorem 2 to various RAAGs. One direction of Theorem 1 is almost clear from Lemma 1.1. Indeed, we have Corollary 1.1.1. Let G = (V, E) be a finite simplicial graph, C ⊂ G a discon￾necting clique of G, and (Γv)v∈G groups. If for all v ∈ V (C), Γv is amenable, 5 [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Suppose the bush at node g is {a, b, c, d}, and {a, b}, {b, c}, {c, d} commute pairwise. Each commuting pair spans a grid, and we use the dotted diagonal lines on the grids to synchronize Y -configurations stored on the rays g{s n | n ∈ N} for different values of s ∈ {a, b, c, d}. 4. Now, we use each bush g⟨B(g)⟩ to simulate a Turing machine, by inscribing an instance of the tiling problem on a copy of Z 2… view at source ↗
Figure 3
Figure 3. Figure 3: One of the grids is used for computation, here we use [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Prism graph. References [1] Nathalie Aubrun, Sebasti´an Barbieri, and Mathieu Sablik. A notion of ef￾fectiveness for subshifts on finitely generated groups. Theoretical Computer Science, 661:35–55, 2017. [2] Sebasti´an Barbieri. A geometric simulation theorem on direct products of finitely generated groups. Discrete Analysis, page 8820, 2019. [3] Sebasti´an Barbieri and Mathieu Sablik. A generalization of … view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper proves that a right-angled Artin group (RAAG) is self-simulable if and only if its defining graph has no disconnecting clique. Self-simulability is defined to mean that every computable action of the group admits an SFT cover (i.e., can be realized subject to finitely many tiling constraints). The manuscript also establishes partial results on self-simulability for general graph products.

Significance. If the central equivalence holds, the result supplies a clean, graph-theoretic criterion that completely classifies self-simulability within the class of RAAGs. The explicit SFT-cover constructions for the positive direction and the concrete computable actions without SFT covers for the negative direction, together with the supporting material on graph products, constitute a substantive contribution at the interface of geometric group theory and symbolic dynamics. The consistent use of standard definitions for RAAGs and the dynamical notion of self-simulability strengthens the claim.

minor comments (2)
  1. §1 (Introduction): the statement of the main theorem could be accompanied by a one-sentence reminder of the precise definition of a disconnecting clique to make the result immediately accessible to readers outside the immediate subfield.
  2. §4 (Graph products): the partial results are presented as supporting context; a short paragraph clarifying which statements remain open for general graph products would help delineate the scope of the RAAG theorem.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, assessment of significance, and recommendation of minor revision. No specific major comments appear in the report, so we have no points requiring point-by-point rebuttal or revision at this stage.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper proves an if-and-only-if characterization of self-simulability for right-angled Artin groups directly from the standard graph-to-group encoding and the dynamical definition of SFT covers for computable actions. Both directions rely on explicit constructions (SFT covers when no disconnecting clique exists) and counterexamples (computable actions without covers when a disconnecting clique exists), without any reduction to fitted parameters, self-definitional loops, or load-bearing self-citations. Partial results on graph products are presented as supporting context rather than core to the RAAG claim, leaving the central equivalence self-contained against external mathematical definitions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on standard background from group theory and symbolic dynamics rather than introducing new fitted parameters or entities.

axioms (2)
  • standard math Standard axioms and definitions of groups, right-angled Artin groups from graphs, and subshifts of finite type.
    The claim is built on established mathematical objects in geometric group theory and dynamical systems.
  • domain assumption The definition of self-simulability as every computable action admitting an SFT cover.
    This is the central property being characterized.

pith-pipeline@v0.9.0 · 5571 in / 1296 out tokens · 46146 ms · 2026-05-21T02:04:09.847495+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    A notion of ef- fectiveness for subshifts on finitely generated groups.Theoretical Computer Science, 661:35–55, 2017

    Nathalie Aubrun, Sebasti´ an Barbieri, and Mathieu Sablik. A notion of ef- fectiveness for subshifts on finitely generated groups.Theoretical Computer Science, 661:35–55, 2017

    work page 2017

  2. [2]

    A geometric simulation theorem on direct products of finitely generated groups.Discrete Analysis, page 8820, 2019

    Sebasti´ an Barbieri. A geometric simulation theorem on direct products of finitely generated groups.Discrete Analysis, page 8820, 2019

    work page 2019

  3. [3]

    A generalization of the simulation theorem for semidirect products.Ergodic Theory and Dynamical Systems, 39(12):3185–3206, 2019

    Sebasti´ an Barbieri and Mathieu Sablik. A generalization of the simulation theorem for semidirect products.Ergodic Theory and Dynamical Systems, 39(12):3185–3206, 2019

    work page 2019

  4. [4]

    Soficity of free exten- sions of effective subshifts.Discrete and Continuous Dynamical Systems- Series A, 45(4):1117–1149, 2025

    Sebasti´ an Barbieri, Mathieu Sablik, and Ville Salo. Soficity of free exten- sions of effective subshifts.Discrete and Continuous Dynamical Systems- Series A, 45(4):1117–1149, 2025

    work page 2025

  5. [5]

    Self-simulable groups

    Sebasti´ an Barbieri, Mathieu Sablik, and Ville Salo. Self-simulable groups. Transactions of the American Mathematical Society, 2026

    work page 2026

  6. [6]

    A geo- metric obstruction to self-simulation for groups, 2025

    Sebasti´ an Barbieri, Kan´ eda Blot, Mathieu Sablik, and Ville Salo. A geo- metric obstruction to self-simulation for groups, 2025

    work page 2025

  7. [7]

    Shifts on the lamplighter group.Trans- actions of the American Mathematical Society, 2026

    Laurent Bartholdi and Ville Salo. Shifts on the lamplighter group.Trans- actions of the American Mathematical Society, 2026. In press

    work page 2026

  8. [8]

    Berger.The Undecidability of the Domino Problem

    R. Berger.The Undecidability of the Domino Problem. Memoirs of the American Mathematical Society. American Mathematical Society, 1966

    work page 1966

  9. [9]

    Symbolic dynamics for hyperbolic flows.American journal of mathematics, 95(2):429–460, 1973

    Rufus Bowen. Symbolic dynamics for hyperbolic flows.American journal of mathematics, 95(2):429–460, 1973. 17

    work page 1973

  10. [10]

    Raagedy right-angled coxeter groups.arXiv preprint arXiv:2506.16789, 2025

    Christopher H Cashen, Pallavi Dani, Alexandra Edletzberger, and An- nette Karrer. Raagedy right-angled coxeter groups.arXiv preprint arXiv:2506.16789, 2025

    work page arXiv 2025

  11. [11]

    Cellular automata

    Tullio Ceccherini-Silberstein and Michel Coornaert. Cellular automata. In Cellular Automata and Groups, pages 1–36. Springer, 2010

    work page 2010

  12. [12]

    Springer, 2006

    Michel Coornaert and Athanase Papadopoulos.Symbolic dynamics and hyperbolic groups. Springer, 2006

    work page 2006

  13. [13]

    Finitely presented dynamical systems.Ergodic Theory and Dynamical Systems, 7(4):489–507, 1987

    David Fried. Finitely presented dynamical systems.Ergodic Theory and Dynamical Systems, 7(4):489–507, 1987

    work page 1987

  14. [14]

    Algorithms and geometry for graph prod- ucts of groups

    Susan Hermiller and John Meier. Algorithms and geometry for graph prod- ucts of groups. 1995

    work page 1995

  15. [15]

    On the dynamics and recursive properties of multidi- mensional symbolic systems.Invent

    Michael Hochman. On the dynamics and recursive properties of multidi- mensional symbolic systems.Invent. Math., 176(1):131–167, 2009

    work page 2009

  16. [16]

    Sofically presented dynamical systems.arXiv preprint arXiv:2105.06767, 2021

    Johan Kopra and Ville Salo. Sofically presented dynamical systems.arXiv preprint arXiv:2105.06767, 2021

    work page arXiv 2021

  17. [17]

    Cambridge University Press, Cambridge, 1995

    Douglas Lind and Brian Marcus.An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge, 1995

    work page 1995

  18. [18]

    Burnside’s problem, spanning trees and tilings.Geometry & Topology, 18(1):179 – 210, 2014

    Brandon Seward. Burnside’s problem, spanning trees and tilings.Geometry & Topology, 18(1):179 – 210, 2014

    work page 2014

  19. [19]

    Robert E. Tarjan. Decomposition by clique separators.Discrete Mathe- matics, 55(2):221–232, 1985

    work page 1985

  20. [20]

    Graph groups are biautomatic.Journal of Pure and Applied Algebra, 94(3):341–352, 1994

    Leonard Van Wyk. Graph groups are biautomatic.Journal of Pure and Applied Algebra, 94(3):341–352, 1994

    work page 1994

  21. [21]

    Proving theorems by pattern recognition I.Commun

    Hao Wang. Proving theorems by pattern recognition I.Commun. ACM, 3(4):220–234, April 1960

    work page 1960

  22. [22]

    Subshifts of finite type and sofic systems.Monatshefte f¨ ur Mathematik, 77:462–474, 1973

    Benjamin Weiss. Subshifts of finite type and sofic systems.Monatshefte f¨ ur Mathematik, 77:462–474, 1973

    work page 1973

  23. [23]

    An algorithm for finding clique cut-sets.Information Processing Letters, 12(1):31–32, 1981

    Sue Hays Whitesides. An algorithm for finding clique cut-sets.Information Processing Letters, 12(1):31–32, 1981. 18

    work page 1981