Maximally symmetric stable curves II
Algebraic Geometry
2007-05-23 v1 Combinatorics
Abstract
We find a sharp bound for the order of the automorphism group of a stable curve of genus with nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results of our article math.CO/0608645 we find that graph theoretically, the cubic graph with a given number of vertices and most automorphisms is simple, but algebro-geometrically, the stable curves with nodes that have the most automorphisms have non-simple dual graph.
Cite
@article{arxiv.math/0608799,
title = {Maximally symmetric stable curves II},
author = {Michael A. van Opstall and Razvan Veliche},
journal= {arXiv preprint arXiv:math/0608799},
year = {2007}
}
Comments
14 pages