Related papers: Some minimisation algorithms in arithmetic invaria…

We analyse the complexity of the computation of the class group structure, regulator, and a system of fundamental units of a certain class of number fields. Our approach differs from Buchmann's, who proved a complexity bound of L(1/2,O(1))…

In this paper we propose a direct and explicit realization of addition of divisors by means of an iterative reduction algorithm. Each iteration of the algorithm is the reduction of a degree $g+1$ divisor to a divisor of degree~$g$. Such an…

This paper reviews known results on the rigid isotopy classification of plane curves of degree $m\leq6$ and curves of small degrees on quadrics. The paper's study completes the rigid isotopy classification of nonsingular real algebraic…

Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of…

Let $X$ be an integral projective variety of codimension two, degree $d$ and dimension $r$ and $Y$ be its general hyperplane section. The problem of lifting generators of minimal degree $\sigma$ from the homogeneous ideal of $Y$ to the…

In this paper, we determine the reduced automorphism groups of hyperelliptic curves of a small genus in characteristic $2$, when they are of $2$-rank $0$. Such a curve is an Artin-Schreier curve defined in the form $y^2-y=f(x)$ for a…

In the Hilbert scheme of curves of degree $d_{r}=\frac{r(r+1)}{2}$ and arithmetic genus $g_{r}=\frac{r(r+1)(2r-5)}{6}+1$ in $\mathbb{P}^{3}$ we prove that there exists a unique component of arithmetically Cohen-Macaulay curves denoted by…

Let $\C$ be a genus 2 curve defined over $k$, $char (k) =0$. If $\C$ has a $(3,3)$-split Jacobian then we show that the automorphism group $Aut(\C)$ is isomorphic to one of the following: $\bZ_2, V_4, D_8$, or $D_{12}$. There are exactly…

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…

We study the problem of computing approximate minimum edge cuts by distributed algorithms. We use a standard synchronous message passing model where in each round, $O(\log n)$ bits can be transmitted over each edge (a.k.a. the CONGEST…

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…

We prove that various subgroups of the mapping class group $Mod(\Sigma)$ of a surface $\Sigma$ are at least exponentially distorted. Examples include the Torelli group (answering a question of Hamenstadt), the "point-pushing" and surface…

We determine all genus 2 curves, defined over $\mathbb C$, which have simultaneously degree 2 and 3 elliptic subcovers. The locus of such curves has three irreducible 1-dimensional genus zero components in $\mathcal M_2$. For each component…

We present an efficient endomorphism for the Jacobian of a curve $C$ of genus 2 (hyperelliptic) for divisors having a Non disjoint support. This extends the work of Costello and Lauter in [12] who calculated explicit formulae for divisor…

We construct and study curves with low H-constants on abelian and K3 surfaces. Using the Kummer $(16_{6})$-configurations on Jacobian surfaces and some $(16_{10})$-configurations of curves on $(1,3)$-polarized Abelian surfaces, we obtain…

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 bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…

We prove that for any number field $K$ and any fixed genus $g \geq 2$, there are infinitely many non-isomorphic hyperelliptic curves of genus $g$ over $K$ whose Jacobians have rank over $K$ equal to each of 0, 1, or 2. As an example of our…

We present algorithms which, given a genus 2 curve $C$ defined over a finite field and a quartic CM field $K$, determine whether the endomorphism ring of the Jacobian $J$ of $C$ is the full ring of integers in $K$. In particular, we present…

A (k, g) graph is a graph with regular degree k and girth g. The cage problem refers to finding the smallest (k, g) graph. The (3, 14) cage problem is known to be unresolved. In 2002, Exoo found a (3, 14) record graph with order 384. The…

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