On the density of Cayley graphs of R.Thompson's group $F$ in symmetric generators
Victor Guba

TL;DR
This paper investigates the density of Cayley graphs of Thompson's group F with symmetric generators, disproving a conjecture that suggested the density equals 3 and showing the group does not have the doubling property with certain generating sets.
Contribution
The paper proves that the density of the Cayley graph of Thompson's group F with symmetric generators exceeds 3, contradicting previous conjectures and demonstrating the absence of the doubling property for specific generating sets.
Findings
Density of Cayley graph in symmetric generators exceeds 3
Thompson's group F does not have the doubling property with certain generators
Disproves previous conjecture about the density being exactly 3
Abstract
By the density of a finite graph we mean its average vertex degree. For an -generated group, the density of its Cayley graph in a given set of generators, is the supremum of densities taken over all its finite subgraphs. It is known that a group with generators is amenable iff the density of the corresponding Cayley graph equals . A famous problem on the amenability of R.\,Thompson's group is still open. What is known due to the result by Belk and Brown, is that the density of its Cayley graph in the standard set of group generators , is at least . This estimate has not been exceeded so far. For the set of symmetric generators , where , the same example gave the estimate only . There was a conjecture that for this generating set the equality holds. If so, would be non-amenable, and the symmetric…
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.
