Pith. Sign in

REVIEW

Accessibility and Twin-width

PaperPDF from arXiv

data files

ReviewThe objections and verdict, as JSON Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
George Kontogeorgiou, Bobby Miraftab

Group Theory · Submitted 7 Jul 2026 · 20 references

Pith's verdict: Clean negative answer to Esperet: finite twin-width does not force accessibility for f.g. groups, via a direct Wilkes + Bonnet–Geniet–Tessera–Thomassé combination.

T0 · AI review

How this review was made: An AI referee (grok-4.5) read the paper on July 8, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 4 minor · Ask about this paper · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2607.05713 (version 1)
Pith IDYUV6MJRC, Pith's permanent record of this paper and its review
CitationBobby Miraftab, George Kontogeorgiou. "Accessibility and Twin-width." arXiv:2607.05713 (2026). https://pith.science/paper/YUV6MJRC
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report

How Pith checks papers → · Full audit of this paper →

The paper

The paper claims

There exists a finitely generated group of finite twin-width that is not accessible.

The reading

The paper proves that finite twin-width does not imply accessibility for finitely generated groups, answering a question of Esperet in the negative. It exhibits a finitely generated group that has finite uniform twin-width yet fails to be accessible. In particular, for every finite generating set of the group the associated Cayley graph has finite twin-width while the group itself remains inaccessible. The example is obtained by combining Wilkes’ construction of finitely generated inaccessible residually p-finite groups with a theorem of Bonnet, Geniet, Tessera and Thomassé on the twin-width of groups that act faithfully on regular rooted trees. A reader who cares about geometric invariants of groups will see this as a clean separation between two properties that might otherwise have been expected to travel together.

What carries the argument

The bridge that residual p-finiteness supplies a faithful action on a regular rooted p-tree, so that Wilkes’ finitely generated inaccessible residually p-finite groups fall under the Bonnet–Geniet–Tessera–Thomassé theorem guaranteeing finite twin-width for groups acting faithfully on regular rooted trees.

Extended reading notes

Core claim

There exists a finitely generated group Γ that has finite uniform twin-width but is not accessible. In particular, for every finite generating set S of Γ, the Cayley graph Cay(Γ; S) has finite twin-width but is not accessible. This shows that finite twin-width does not imply accessibility for finitely generated groups.

Load-bearing premise

That Wilkes’ finitely generated inaccessible residually p-finite groups act faithfully on regular rooted trees, so the twin-width theorem for such actions applies.

Editorial extensions

If this is right

  • Finite twin-width of every Cayley graph does not force a finitely generated group to be accessible.
  • Esperet’s question is settled negatively: finite twin-width does not imply accessibility for finitely generated groups.
  • There exist finitely generated groups whose uniform twin-width is finite yet which remain inaccessible.
  • Residual p-finiteness together with a faithful tree action can produce groups of finite twin-width with pathological accessibility behaviour.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same residual-p-finiteness-plus-tree-action template may separate twin-width from other geometric properties such as finite asymptotic dimension.
  • One could test whether the constructed groups also provide counter-examples for other width parameters versus accessibility.
  • If the faithful-tree-action hypothesis can be relaxed, larger classes of inaccessible groups might be shown to have finite twin-width.
Original abstract

We show that finite twin-width does not imply accessibility for finitely generated groups, which answers a question of Esperet. That is, we prove that there exists a finitely generated group $\Gamma$ that has finite uniform twin-width but is not accessible. In particular, for every finite generating set $S$ of $\Gamma$, the Cayley graph $Cay(\Gamma ; S)$ has finite twin-width but is not accessible. The example is obtained by combining Wilkes construction of a finitely generated inaccessible residually $p$-finite groups with a result of Bonnet, Geniet, Tessera and Thomasse regarding the twin-width of groups acting faithfully on regular rooted trees.

References

How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.