Related papers: Branching data for curves up to genus 48
Cell formation is a critical step in the design of cellular manufacturing systems. Recently, it was tackled using a cut-based-graph-partitioning model. This model meets real-life production systems requirements as it uses the actual amount…
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…
For a genus $2$ curve $C$ over $\mathbb{Q}$ whose Jacobian $A$ admits only trivial geometric endomorphisms, Serre's open image theorem for abelian surfaces asserts that there are only finitely many primes $\ell$ for which the Galois action…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
In this paper we develop techniques for computing the relative Brauer group of curves, focusing particularly on the case where the genus is 1. We use these techniques to show that the relative Brauer group may be infinite (for certain…
We study upper bounds on the order of automorphisms of non-singular curves $X$ satisfying at least one of the following hypothesis: 1) $X$ is an $m$-sheeted covering of exactly one non-singular curve of genus $\gamma$, where $m$ is prime;…
Graph Crossing Number is a fundamental problem with various applications. In this problem, the goal is to draw an input graph $G$ in the plane so as to minimize the number of crossings between the images of its edges. Despite extensive…
The branching algorithm is a fundamental technique for designing fast exponential-time algorithms to solve combinatorial optimization problems exactly. It divides the entire solution space into independent search branches using…
A new genus $g=g(X,\ce)$ is defined for the pairs $(X,\ce)$ that consist of $n$-dimensional compact complex manifolds $X$ and ample vector bundles $\ce$ of rank $r$ less than $n$ on $X$. In case $r=n-1$, $g$ is equal to curve genus. Above…
The study of algebraic curves $\cX$ with numerous automorphisms in relation to their genus $g(\cX)$ is a well-established area in Algebraic Geometry. In 1995, Irokawa and Sasaki \cite{Sasaki} gave a complete classification of curves over…
This work aims to study and explore the use of Gene Expression Programming (GEP) in solving the on-line Bin-Packing problem. The main idea is to show how GEP can automatically find acceptable heuristic rules to solve the problem efficiently…
The CREAM GAP package computes automorphisms, congruences, endomorphisms and subalgebras of algebras with an arbitrary number of binary and unary operations; it also decides if between two such algebras there exists a monomorphism, an…
In this paper we describe an algorithm visiting all numerical semigroups up to a given genus using a well suited representation. The interest of this algorithm is that it fits particularly well the architecture of modern computers allowing…
We describe a method that allows, under some hypotheses, to compute all the rational points of some genus 5 curves defined over a number field. This method is used to solve some arithmetic problems that remained open.
This paper focuses on the classification of classes of topological equivalence of finite group actions on Riemann surfaces. By the Riemann-Hurwitz bound, there are just finitely many groups that act conformally on a closed orientable…
A closed Riemann surface $S$ (of genus at least one) is called an origami curve if it admits a non-constant holomorphic map $\beta:S \to E$ with at most one branch value, where $E$ is a genus one Riemann surface. In this case, $(S,\beta)$…
The goal of this paper is to explicitly detect all the arithmetic genera of arithmetically Cohen-Macaulay projective curves with a given degree $d$. It is well-known that the arithmetic genus $g$ of a curve $C$ can be easily deduced from…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
In this article we introduce Graph Generation, an enhanced Column Generation (CG) algorithm for solving expanded linear programming relaxations of mixed integer linear programs. To apply Graph Generation, we must be able to map any given…
The branchwidth of a graph has been introduced by Roberson and Seymour as a measure of the tree-decomposability of a graph, alternative to treewidth. Branchwidth is polynomially computable on planar graphs by the celebrated ``Ratcatcher''…