Related papers: On Jacobian group arithmetic for typical divisors …

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

We obtain a formula for the degrees of the varieties parameterizing complex algebraic curves of any divisor class and genus on P^2_6, the projective plane blown-up at 6 generic points. Moreover, the formula computes the degrees of the…

Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…

This paper is the first version of a project of classifying all superelliptic curves of genus $g \leq 48$ according to their automorphism group. We determine the parametric equations in each family, the corresponding signature of the group,…

In this article, we generalize several fundamental results for arithmetic divisors, such as the continuity of the volume function, the generalized Hodge index theorem, Fujita's approximation theorem for arithmetic divisors and Zariski…

Let $k$ be an algebraically closed field. Let $C$ be an irreducible smooth projective curve over $k$. Let $E$ be a locally free sheaf on $C$ of rank $\geq 2$. Fix an integer $d \geq 2$. Let $\mathcal{Q}$ denote the Quot scheme…

We extend the work of Cremona, Fisher and Stoll on minimising genus one curves of degrees 2,3,4,5, to some of the other representations associated to genus one curves, as studied by Bhargava and Ho. Specifically we describe algorithms for…

This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common…

We compute the class of arithmetic genus two Teichmueller curves in the Picard group of pseudo-Hilbert modular surfaces, distinguished according to their torsion order and spin invariant. As an application, we compute the number of genus…

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

In the theory of algebraic groups, parabolic subgroups form a crucial building block in the structural studies. In the case of general linear groups over a finite field $F_q$, given a sequence of positive integers $n_1, ..., n_k$, where…

Let $C$ be a smooth projective curve over the field of complex numbers $\mathbb{C}$ of genus $g(C)>0$. Let $E$ be a locally free sheaf on $C$ of rank $r$ and degree $e$. Let $\mathcal{Q}:={\rm Quot}_{C/\mathbb{C}}(E,k,d)$ denote the Quot…

In this paper we begin to study curves on a weighted projective plane with one trivial weight, ${\mathbb P}(1,m,n)$, by determining the genus of curves of Fermat type. These are curves defined by a ``homogeneous'' polynomial analagous to…

We construct the logarithmic and tropical Picard groups of a family of logarithmic curves and realize the latter as the quotient of the former by the algebraic Jacobian. We show that the logarithmic Jacobian is a proper family of…

Let $U$ be a smooth and connected curve over an algebraically closed field of positive characteristic, with smooth compactification $X$. We generalize classical Geometric Class Field theory to provide a classification of fppf $G$-torsors…

We describe a probability distribution on isomorphism classes of principally quasi-polarized p-divisible groups over a finite field k of characteristic p which can reasonably be thought of as "uniform distribution," and we compute the…

One of the great triumphs in the history of numerical methods was the discovery of the Conjugate Gradient (CG) algorithm. It could solve a symmetric positive-definite system of linear equations of dimension N in exactly N steps. As many…

We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.

We characterize contractible curves on proper normal algebraic surfaces in terms of complementary Weil divisors. Using this we generalize the classical criteria of Castelnuovo and Artin. As application we derive a finiteness result on…

Regularizing the gradient norm of the output of a neural network with respect to its inputs is a powerful technique, rediscovered several times. This paper presents evidence that gradient regularization can consistently improve…