Related papers: Group Operation on Nodal Curves
We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing an explicit treatment of the computations in quartic CM…
Consider the Jacobian of a hyperelliptic genus two curve defined over a prime field of characteristic p and with complex multiplication. In this paper we show that the p-Sylow subgroup of the Jacobian is either trivial or of order p.
We study an explicit $(2g-1)$-dimensional family of Jacobian varieties of dimension $\frac{d-1}2(g-1)$, arising from quotient curves of unramified cyclic coverings of prime degree $d$ of hyperelliptic curves of genus $g\ge 2$. By using a…
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…
We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono\"i's algorithm for computing perfect forms,…
In this technical note we show how to reach a remarkable speed up when solving elliptic partial differential equations with finite differences thanks to the joint use of the Chebyshev-Jacobi method with high order discretizations and its…
This article presents a compact implementation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. Each iteration of the algorithm consists of applying a pair of complementary Gauss-Jordan…
Numerical tools for computation of $\wp$-functions, also known as Kleinian, or multiply periodic, are proposed. In this connection, computation of periods of the both first and second kinds is reconsidered. An analytical approach to…
Given a genus two curve $X: y^2 = x^5 + a x^3 + b x^2 + c x + d$, we give an explicit parametrization of all other such curves $Y$ with a specified symplectic isomorphism on three-torsion of Jacobians $\mbox{Jac}(X)[3] \cong…
Let K be a field of characteristic zero, f(x) be a polynomial with coefficients in K and without multiple roots. We consider the superelliptic curve C_{f,q} defined by y^q=f(x), where q=p^r is a power of a prime p. We determine the Hodge…
In this paper we present a method for direct evaluation of generalized B-splines (GB-splines) via the local representation of these curves as piecewise functions. To accomplish this we introduce a local structure that makes GB-spline curves…
In this paper we obtain an explicit formula for the number of curves in a compact complex surface $X$ (passing through the right number of generic points), that has up to one node and one singularity of codimension $k$, provided the total…
Spectral discretizations of fractional derivative operators are examined, where the approximation basis is related to the set of Jacobi polynomials. The pseudo-spectral method is implemented by assuming that the grid, used to represent the…
In the present paper we suggest a simple approach for counting Jacobian group of the $Y$-graph $Y(n; k, l, m).$ In the case $Y(n; 1, 1, 1)$ the structure of the Jacobian group will be find explicitly. Also, we obtain a closed formula for…
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…
For any positive integer $k$, let $X_k$ be a projective irreducible nodal curve with $k$ nodes. We show that the Betti numbers and the mixed Hodge numbers of the compactified Jacobian $\overline{J_{k}}$ of an irreducible nodal curve $X_k$…
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
We provide a characterization for complex analytic curves among two-dimensional minimal graphs in $\mathbb{R}^{4}$ via the Jacobian
We prove autoduality for curves of compact type and, more generally, treelike curves with planar singularities. More precisely, we produce an isomorphism between the generalized Jacobian of such a curve and the connected component of the…