Related papers: Division polynomials in Mumford coordinates

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

Let C be a general connected, smooth, projective curve of positive genus g. For each nonnegative integer i we give formulas for the number of pairs (P,Q) em C x C off the diagonal such that (g+i-1)Q-(i+1)P is linearly equivalent to an…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

We give a separation bound for the complex roots of a trinomial $f \in \mathbb{Z}[X]$. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of $f$; in particular, it is polynomial in $\log…

We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…

Geometric torsions are torsions of acyclic complexes of vector spaces which consist of differentials of geometric quantities assigned to the elements of a manifold triangulation. We use geometric torsions to construct invariants for a…

We compute divisors class groups of singular surfaces. Most notably we produce an exact sequence that relates the Cartier divisors and almost Cartier divisors of a surface to the those of its normalization. This generalizes Hartshorne's…

We define twisted Alexander polynomials of a complex hypersurface with arbitrary singularities. These generalize the classical Alexander polynomials of high dimensional hypersurfaces and the twisted Alexander polynomial of plane curves. We…

We use machine learning to study the moduli space of genus two curves, specifically focusing on detecting whether a genus two curve has $(n, n)$-split Jacobian. Based on such techniques, we observe that there are very few rational moduli…

This paper presents a regularization theory for numerical computation of polynomial greatest common divisors and a convergence analysis, along with a detailed description of a blackbox-type algorithm. The root of the ill-posedness in…

This paper provides a probabilistic algorithm to determine generators of the m-torsion subgroup of the Jacobian of a hyperelliptic curve of genus two.

In this paper, we introduce the notion of Jacobi polynomials with multiple reference vectors of a code, and give the MacWilliams type identity for it. Moreover, we derive a formula to obtain the Jacobi polynomials using the Aronhold…

We give a bound on the primes dividing the denominators of invariants of Picard curves of genus 3 with complex multiplication. Unlike earlier bounds in genus 2 and 3, our bound is based not on bad reduction of curves, but on a very explicit…

We construct a natural branch divisor for equidimensional projective morphisms where the domain has lci singularities and the target is nonsingular. The method involves generalizing a divisor contruction of Mumford from sheaves to…

Work of Laurent and Sarnak, following a conjecture of Lang, shows that the number of torsion points of order n on an algebraic subset of an affine complex torus is polynomial periodic. In this paper, we find bounds on the degree and period…

In this article, we study the geometry of plane curves obtained by three sections and another section given as their sum on certain rational elliptic surfaces. We make use of Mumford representations of semi-reduced divisors in order to…

Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…

For genus $g=2i\geq4$ and the length $g-1$ partition $\mu = (4,2,\ldots,2,-2,\ldots,-2)$ of 0, we compute the first coefficients of the class of $\overline{D}(\mu)$ in $\mathrm{Pic}_\mathbb{Q}(\overline{\mathcal{R}}_g)$, where $D(\mu)$ is…

We describe how to compute for two polynomials $f(X), g(X) \in \mathbb{Z}[X]$ with integer coefficients the greatest common divisors of $f(z)$ and $g(z)$ for all integers $z \in \mathbb{Z}$. As an application we determine the structures…

We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibility sequences of order 2. Moreover, we show a new…