Related papers: Branching data for curves up to genus 48

This paper is devoted to constructing an explicit efficient representation for the Jacobian variety of a nonsingular curve of genus greater than 1, and its group law. We describe an algorithm for executing the group law on the Jacobian…

We study the $\mu _N$-gerbe of curves of genus $g$ with an order $N$ automorphism, and explore what corresponding $H^2$-cohomology classes the components of this stack can have. In particular, we look at curves whose quotients by the order…

We describe an algorithm that constructs a list of all topological types of holomorphic actions of a finite group on a compact Riemann surface $C$ of genus at least $g \geq 2$ with $C/G \cong \mathbb{P}^1$.

Let $\mathcal{X}$ be a (projective, non-singular, irreducible) curve of even genus $g(\mathcal{X}) \geq 2$ defined over an algebraically closed field $K$ of characteristic $p$. If the $p$-rank $\gamma(\mathcal{X})$ equals $g(\mathcal{X})$,…

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated with totally ramified places, which enables us to study…

Let $k$ be a perfect field and let $p$ be a prime number different from the characteristic of $k$. Let $C$ be a smooth, projective and geometrically integral $k$-curve and let $X$ be a Severi-Brauer $C$-scheme of relative dimension $p-1$ .…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…

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

In this paper we enumerate nonhyperelliptic superspecial curves of genus $4$ over prime fields of characteristic $p\le 11$. Our algorithm works for nonhyperelliptic curves over an arbitrary finite field in characteristic $p \ge 5$. We…

Let $\X$ be an algebraic curve of genus $g \geq 2$ defined over a field $\F_q$ of characteristic $p > 0$. From $\X$, under certain conditions, we can construct an algebraic geometry code $C$. If the code $C$ is self-orthogonal under the…

Predicting the cheapest sample size for the optimal stratification in multivariate survey design is a problem in cases where the population frame is large. A solution exists that iteratively searches for the minimum sample size necessary to…

We describe two similar but independently-coded computations used to construct a complete catalogue of the transitive groups of degree less than $48$, thereby verifying, unifying and extending the catalogues previously available. From this…

This paper focuses on the statistical analysis of shapes of data objects called shape graphs, a set of nodes connected by articulated curves with arbitrary shapes. A critical need here is a constrained registration of points (nodes to…

We present an $O^*(1.0919^n)$-time algorithm for finding a maximum independent set in an $n$-vertex graph with degree bounded by 3, which improves the previously known algorithm of running time $O^*(1.0977^n)$ by Bourgeois, Escoffier and…

A Howe curve is a curve of genus $4$ obtained as the fiber product of two genus-$1$ double covers of $\mathbf{P}^1$. In this paper, we present a simple algorithm for testing isomorphism of Howe curves, and we propose two main algorithms for…

For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…

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 consider the question of orienting the edges in a graph $G$ such that every vertex has bounded out-degree. For graphs of arboricity $\alpha$, there is an orientation in which every vertex has out-degree at most $\alpha$ and, moreover,…