On large groups of symmetries of finite graphs embedded in spheres
Abstract
Let G be a finite group acting orthogonally on a pair (Sd,) where is a finite, connected graph of genus g>1 embedded in the sphere Sd. The 3-dimensional case d=3 has recently been considered in a paper by C. Wang, S. Wang, Y. Zhang and the present author where for each genus g>1 the maximum order of a G-action on a pair (S3,) is determined and the corresponding graphs are classified. In the present paper we consider arbitrary dimensions d and prove that the order of G is bounded above by a polynomial of degree d/2 in g if d is even, and of degree (d+1)/2 if d is odd; moreover the degree d/2 is best possible in even dimensions d. We discuss also the problem, given a finite graph and its finite symmetry group, to find the minimal dimension of a sphere into which embeds equivariantly as above.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.