Related papers: Maximally symmetric stable curves II

We give upper bounds on the order of the automorphism group of a simple graph

Let $\mathcal{X}$ be an algebraic curve of genus $g$ defined over an algebraically closed field $K$ of characteristic $p \geq 0$, and $q$ a prime dividing $|\mbox{Aut}(\mathcal{X})|$. We say that $\mathcal{X}$ is a $q$-curve. Homma proved…

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…

Let $k$ be an algebraically closed field of characteristic $p >0$. Suppose $g \geq 3$ and $0 \leq f \leq g$. We prove there is a smooth projective $k$-curve of genus $g$ and $p$-rank $f$ with no non-trivial automorphisms. In addition, we…

We prove a tropical analogue of the theorem of Hurwitz: a leafless metric graph of genus $g \ge 2$ has at most $12$ automorphisms when $g = 2$; $2^g g!$ automorphisms when $g \ge 3$. These inequalities are optimal; for each genus, we give…

Let $\mathcal{X}$ be a smooth Fano threefold over the complex numbers of Picard rank $1$ with finite automorphism group. We give numerical restrictions on the order of the automorphism group $\mathrm{Aut}(\mathcal{X})$ provided the genus…

Let $N$ be a connected nonorientable surface of genus $g$ with $n$ punctures. Suppose that $g$ is odd and $g+n \geqslant 6$. We prove that the automorphism group of the complex of curves of $N$ is isomorphic to the mapping class group…

A Mumford curve of genus g=5,6,7 or 8 over a non-archimedean field of characteristic p (such that if p=0, the residue field characteristic exceeds 5) has at most 12(g-1) automorphisms. In this paper, all curves that attain this bound and…

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…

We present the program Boundary, whose source files are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural numbers g and n satisfying 2g+n-2>0, the program generates all genus g stable graphs with n unordered marked…

We describe smooth rational projective algebraic surfaces over an algebraically closed field of characteristic different from 2 which contain $n \ge \b_2-2$ disjoint smooth rational curves with self-intersection -2, where $\b_2$ is the…

For $a,b\geq 3$, we calculate the orders of automorphisms of smooth curves with bidegree $(a,b)$ in the product $\pp$ of the projective line $\mathbb P^1$. We identify smooth curves in $\pp$ which have automorphisms with the largest orders.…

In positive characteristic, algebraic curves can have many more automorphisms than expected from the classical Hurwitz's bound. There even exist algebraic curves of arbitrary high genus g with more than 16g^4 automorphisms. It has been…

Let $\mathcal{X}$ be an ordinary (projective, geometrically irreducible, nonsingular) algebraic curve of genus $\mathcal{g}(\mathcal{X}) \ge 2$ defined over an algebraically closed field $\mathbb{K}$ of odd characteristic $p$. Let…

The maximal number of automorphisms of a Mumford curve over a non-archimedean valued field of positive characteristic is known. In this note, the unique family of curves that attains this bound in genus not equal to 5,6,7 or 8 is explicitly…

We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…

Recently, the first author classified finite groups obtained as automorphism groups of smooth plane curves of degree $d \ge 4$ into five types. He gave an upper bound of the order of the automorphism group for each types. For one of them,…

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…

The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic $2$-groups. We show that for any natural $n\ge 2$ there is an undirected graph…