Cayley graphs with few automorphisms
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917972587577344 |
|---|---|
| author | Leemann, Paul-Henry de la Salle, Mikael |
| author_facet | Leemann, Paul-Henry de la Salle, Mikael |
| contents | We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above Cayley directed graph does not have bigons. On the other hand, if G is neither generalized dicyclic nor abelian and has an element of order at least $(2rank(G))^{36}$, then it admits an undirected Cayley graph with automorphism group equal to G. This extends classical results for finite groups and free products of groups. The above results are obtained as corollaries of a stronger form of rigidity which says that the rigidity of the graph can be observed in a ball of radius 1 around a vertex. This strong rigidity result also implies that the Cayley (di)graph covers very few (di)graphs. In particular, we obtain Cayley graphs of Tarski monsters which essentially do not cover other quasi-transitive graphs.
We also show that a finitely generated group admits a locally finite labelled unoriented Cayley graph with automorphism group equal to itself if and only if it is neither generalized dicyclic nor abelian with an element of order greater than 2. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1812_02199 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Cayley graphs with few automorphisms Leemann, Paul-Henry de la Salle, Mikael Combinatorics Group Theory 05C25, 05C20, 05C63, 20B25, 20B27 We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above Cayley directed graph does not have bigons. On the other hand, if G is neither generalized dicyclic nor abelian and has an element of order at least $(2rank(G))^{36}$, then it admits an undirected Cayley graph with automorphism group equal to G. This extends classical results for finite groups and free products of groups. The above results are obtained as corollaries of a stronger form of rigidity which says that the rigidity of the graph can be observed in a ball of radius 1 around a vertex. This strong rigidity result also implies that the Cayley (di)graph covers very few (di)graphs. In particular, we obtain Cayley graphs of Tarski monsters which essentially do not cover other quasi-transitive graphs. We also show that a finitely generated group admits a locally finite labelled unoriented Cayley graph with automorphism group equal to itself if and only if it is neither generalized dicyclic nor abelian with an element of order greater than 2. |
| title | Cayley graphs with few automorphisms |
| topic | Combinatorics Group Theory 05C25, 05C20, 05C63, 20B25, 20B27 |
| url | https://arxiv.org/abs/1812.02199 |