Papers
Topics
Authors
Recent
Search
2000 character limit reached

On rotarily transitive graphs

Published 19 May 2016 in math.CO, math.GR, and math.MG | (1605.06054v2)

Abstract: From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall that Cayley graphs can be defined as non-empty locally finite connected graphs endowed with a transitive group action such that any non-identity element acts without fixed point. We define a class of transitive graphs which are transitive in an "absolutely non-Cayley way": we consider graphs endowed with a transitive group action such that any element of the group acts with a fixed point. We call such graphs "rotarily transitive graphs", and we show that, even though there is no finite rotarily transitive graph with at least 2 vertices, there is an infinite locally finite connected rotarily transitive graph. The proof is based on groups built by Ivanov which are finitely generated, of finite exponent and have a small number of conjugacy classes. We also build infinite transitive graphs (which are not locally finite) any automorphism of which has a fixed point. This is done by considering "unit distance graphs" associated with the projective plane over suitable subfields of the real numbers.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.