相关论文: A note on polylogarithms on curves and abelian sch…
We present a comprehensive analysis of the coupled scheme introduced in [Springer Proceedings in Mathematics \& Statistics, vol 237. Springer, Cham 2018 \cite{S2018}] for linear and Hamilton-Jacobi equations. This method merges two distinct…
In this paper, we give two algorithms to compute preimages of curves under polynomial endomorphisms. In particular, this gives an efficient way of computing preimages of points. Furthermore, we explain the abstract setting under which one…
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
We study the inverse Jacobian problem for the case of Picard curves over $\mathbb{C}$. More precisely, we elaborate on an algorithm that, given a small period matrix $\Omega\in \mathbb{C}^{3\times 3}$ corresponding to a principally…
This paper gives a conjectural characterization of those elliptic curves over the field of complex numbers which "should" be covered by standard modular curves. The elliptic curves in question all have algebraic j-invariant, so they can be…
A general scheme for determining and studying integrable deformations of algebraic curves is presented. The method is illustrated with the analysis of the hyperelliptic case. An associated multi-Hamiltonian hierarchy of systems of…
The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…
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…
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…
A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…
This note gives a simple approach to q-analogues of some results associated with Abel polynomials.
Let C be an integral projective curve in any characteristic. Given an invertible sheaf L on C of degree 1, form the associated Abel map A_L : C -> P, which maps C into its compactified Jacobian scheme P, and form its pullback map A_L^* :…
The degree of a curve $C$ in a polarized abelian variety $(X,\lambda)$ is the integer $d=C\cdot\lambda$. When $C$ generates $X$, we find a lower bound on $d$ which depends on $n$ and the degree of the polarization $\lambda$. The smallest…
This paper is the third installment in a series of papers devoted to the computation of enumerative invariants of abelian surfaces through the tropical approach. We develop a pearl diagram algorithm similar to the floor diagram algorithm…
The Narasimhan-Nori conjecture asks for a closed formula for the number of non-isomorphic principal polarizations of any given abelian variety. In this paper, we introduce a new algorithm that gives a lower bound on the number of…
The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
We describe a method to determine all the isomorphism classes of principal polarizations of the modular abelian surfaces $A_f$ with quaternionic multiplication attached to a normalized newform $f$ without complex multiplication. We include…
The contact structure of two meromorphic curves gives a factorization of their jacobian.
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…