Related papers: Maximally symmetric stable curves II

I show that the set of smooth curves of genus g admitting branched coverings X->P^1 with only triple ramification points has dimension at least max(2g-3,g). In characteristic two, such curves have tame rational functions and an analog of…

Among the simplest invariants of the sporadic finite simple groups are their outer automorphism groups. For 12 of the 26 possible isomorphism types of a sporadic simple group G, the outer automorphism group Out(G) has order 2, and in the…

Given an automorphism of a smooth complex algebraic curve, there is an induced action on the moduli space of semi-stable rank 2 holomorphic bundles with fixed determinant. We give a complete description of the fixed variety in terms of…

We analyze the Brill-Noether theory of trivalent graphs and multigraphs having largest possible automorphism group in a fixed genus. For trivalent multigraphs with loops of genus at least 3, we show that there exists a graph with maximal…

We consider smooth plane curves $\mathcal{X}$ of degree $d\geq4$, defined over an algebraically closed field of characteristic $0$, that possess a unique outer Galois point. This geometric condition forces the curve to be a cyclic covering…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Let G be a finite group, and $g \geq 2$. We study the locus of genus g curves that admit a G-action of given type, and inclusions between such loci. We use this to study the locus of genus g curves with prescribed automorphism group G. We…

The Stable Reduction Theorem guarantees that any smooth, projective, geometrically irreducible curve of genus $g \geq 2$ over a discretely valued field admits a unique stable model after a finite field extension. Computing this model is a…

For a curve $X$ of genus $>1$ defined over a finite field, we present a criterion which allows us to state the non existence of automorphisms of order a power of a rational prime. We show how this criterion can be used to determine the…

For every $n\geq 3, g\geq 1$ and all large enough $e$ depending on $n,g$, there exist curves of genus $g$, degree $e$ in a general hypersurface of degree $n$ in $\mathbb P^n$, or in $\mathbb P^n$ itself, whose whose normal bundle $N$ is…

Given an integer $\gamma\geq 2$ and an odd prime power $q$ we show that for every large genus $g$ there exists a non-singular curve $C$ defined over $\mathbb{F}_q$ of genus $g$ and gonality $\gamma$ and with exactly $\gamma(q+1)$…

For each closed surface of genus $g\ge3$, we find a finite subcomplex of the separating curve complex that is rigid with respect to incidence-preserving maps.

We show that all the automorphisms of the symmetric product Sym^d(X), d>2g-2, of a smooth projective curve X of genus g>2 are induced by automorphisms of X.

We show that the complex of homologous curves of a closed, oriented surface of genus g is (g-3)--acyclic.

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

The genus of a maximal curve over a finite field with r^2 elements is either g_0=r(r-1)/2 or less than or equal to g_1=(r-1)^2/4. Maximal curves with genus g_0 or g_1 have been characterized up to isomorphism. A natural genus to be studied…

The equator of a graph is the length of a longest isometric cycle. We bound the order $n$ of a graph from below by its equator $q$, girth $g$ and minimum degree $\delta$ - and show that this bound is sharp when there exists a Moore graph…

We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. If the isolated vertex is excluded as trivial, nut graphs have seven or more vertices;…

A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs…