Related papers: Branching data for curves up to genus 48

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…

In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…

An irreducible, algebraic curve $\mathcal X_g$ of genus $g\geq 2$ defined over an algebraically closed field $k$ of characteristic $\mbox{char } \, k = p \geq 0$, has finite automorphism group $\mbox{Aut} (\mathcal X_g)$. In this paper we…

Using class field theory one associates to each curve C over a finite field, and each subgroup G of its divisor class group, unramified abelian covers of C whose genus is determined by the index of G. By listing class groups of curves of…

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…

In this paper, we explicitly determine the automorphism group of every nonhyperelliptic superspecial curve of genus $4$ over $\mathbb{F}_{11}$. Our algorithm determining automorphism groups works for any nonhyperelliptic curves of genus $4$…

This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…

Let $\mathcal{C}$ be a plane curve defined over the algebraic closure $K$ of a prime finite field $\mathbb{F}_p$ by a separated polynomial, that is $\mathcal{C}: A(y)=B(x)$, where $A(y)$ is an additive polynomial of degree $p^n$ and the…

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…

In arithmetic and algebraic geometry, superspecial (s.sp.\ for short) curves are one of the most important objects to be studied, with applications to cryptography and coding theory. If $g \geq 4$, it is not even known whether there exists…

While the numbers of superspecial curves of genus at most 3 are well understood, and several computational approaches have been developed to count superspecial curves of genus 4 with large automorphism groups, much less is known in higher…

Mapper, a topological algorithm, is frequently used as an exploratory tool to build a graphical representation of data. This representation can help to gain a better understanding of the intrinsic shape of high-dimensional genomic data and…

Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…

An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant…

Let $\X$ be an irreducible, smooth, projective curve of genus $g \geq 2$ defined over the complex field $\C.$ Then there is a covering $\pi: \X \longrightarrow \P^1,$ where $\P^1$ denotes the projective line. The problem of expressing…

Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…

Information spread is an intriguing topic to study in network science, which investigates how information, influence, or contagion propagate through networks. Graph burning is a simplified deterministic model for how information spreads…

This work introduces two techniques for the design and analysis of branching algorithms, illustrated through the case study of the Vertex Cover problem. First, we present a method for automatically generating branching rules through a…

Bayesian nonparametric mixtures and random partition models are powerful tools for probabilistic clustering. However, standard independent mixture models can be restrictive in some applications such as inference on cell lineage due to the…