Activities per year
Abstract
We characterize the finitely generated groups that admit a Cayley graph whose only automorphisms are the translations, confirming a conjecture by Watkins from 1976. The proof relies on random walk techniques. As a consequence, every finitely generated group admits a Cayley graph with countable automorphism group. We also treat the case of directed graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 73-92 |
| Journal | Annales Henri Lebesgue |
| Volume | 5 |
| DOIs | |
| Publication status | Published - Sept 2022 |
Fingerprint
Dive into the research topics of 'Cayley graphs with few automorphisms: the case of infinite groups'. Together they form a unique fingerprint.-
Rigidity of Cayley graphs
Leemann, P.-H. (Speaker)
10 Nov 2023Activity: Talk or presentation › Invited talk
-
Random walks on infinite groups: some applications
Leemann, P.-H. (Speaker)
16 Oct 2023Activity: Talk or presentation › Invited talk
-
Cayley graphs with few automorphisms
Leemann, P.-H. (Speaker)
23 Sept 2022Activity: Talk or presentation › Presentation at conference/workshop/seminar