Related papers: Mumford curves with maximal automorphism group

The defect of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre upper bound for the number of points on the curve. We present algorithms for constructing curves of genus 5,…

We obtain the modular automorphism group of any quotient modular curve of level $N$, with $4,9\nmid N$. In particular, we obtain some non-expected automorphisms of order 3 that appear for the quotient modular curves when the Atkin-Lehner…

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

We prove the existence of curves of genus $7$ and $12$ over the field with $11^5$ elements, reaching the Hasse-Weil-Serre upper bound. These curves are quotients of modular curves and we give explicit equations. We compute the number of…

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…

A projective non-singular plane algebraic curve of degree d<=4 is called maximally symmetric if it attains the maximum order of the automorphism groups for complex non-singular plane algebraic curves of degree d. For d<=7, all such curves…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

In previous work we determined automorphism groups of cyclic algebraic curves defined over fields of any odd characteristic. In this paper we determine parametric equations of families of curves for each automorphism group for such curves.

We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…

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,…

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…

We prove that in dimensions not equal to 4, 5, or 7, the homology and homotopy groups of the classifying space of the topological group of diffeomorphisms of a disk fixing the boundary are finitely generated in each degree. The proof uses…

We obtain the list of automorphism groups for smooth plane sextic curves over an algebraically closed field K of characteristic p=0 or p>21. Moreover, we assign to each group a geometrically complete family over K describing its…

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…

A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group…

Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…

For each of the 14 classes of edge-transitive maps described by Graver and Watkins, necessary and sufficient conditions are given for a group to be the automorphism group of a map, or of an orientable map without boundary, in that class.…

We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.

In this paper we classify curves of genus 2 with group of automorphisms isomorphic to D_8 or D_12 over an arbitrary field k (of characteristic different from 2 in the D_8 case and from 2 and 3 in the D_{12} case) up to k-isomorphism. As an…

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…