Genus bounds in right-angled Artin groups
Max Forester, Ignat Soroko, Jing Tao

TL;DR
This paper establishes lower bounds on stable commutator length in right-angled Artin groups based on the chromatic number and triangle-free conditions of their defining graphs, using geometric methods.
Contribution
It provides new bounds on stable commutator length in right-angled Artin groups depending on graph properties, extending previous geometric approaches.
Findings
Stable commutator length ≥ 1/(6k) for graphs with chromatic number k.
Stable commutator length ≥ 1/20 for triangle-free graphs.
Results derived via elementary geometric arguments.
Abstract
We show that in any right-angled Artin group whose defining graph has chromatic number , every non-trivial element has stable commutator length at least . Secondly, if the defining graph does not contain triangles, then every non-trivial element has stable commutator length at least . These results are obtained via an elementary geometric argument based on earlier work of Culler.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
