相关论文: An Application of Nodal Curves

Let $f\col\C\ra B$ be a regular local smoothing of a nodal curve. In this paper, we find a modular description of the Abel--N\'eron map having values in Esteves's fine compactified Jacobian and extending the degree-2 Abel--Jacobi map of the…

Let $f=(f_1, f_2)$ be a regular sequence of affine curves in $\bC^2$. Under some reduction conditions achieved by composing with some polynomial automorphisms of $\bC^2$, we show that the intersection number of curves $(f_i)$ in $\bC^2$…

Nonlinear equations are challenging to solve due to their inherently nonlinear nature. As analytical solutions typically do not exist, numerical methods have been developed to tackle their solutions. In this article, we give a quantum…

We consider a family of steady free-surface flow problems in two dimensions, concentrating on the effect of nonlinearity on the train of gravity waves that appear downstream of a disturbance. By exploiting standard complex variable…

Learning expressive probabilistic models correctly describing the data is a ubiquitous problem in machine learning. A popular approach for solving it is mapping the observations into a representation space with a simple joint distribution,…

We show how to efficiently compute functions on jacobian varieties and their quotients. We deduce a quasi-optimal algorithm to compute $(l,l)$ isogenies between jacobians of genus two curves.

We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…

By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple,…

We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…

We consider the problem of finding cryptographically suitable Jacobians. By applying a probabilistic generic algorithm to compute the zeta functions of low genus curves drawn from an arbitrary family, we can search for Jacobians containing…

We develop a cohomological description of various explicit descents in terms of generalized Jacobians, generalizing the known description for hyperelliptic curves. Specifically, given an integer $n$ dividing the degree of some reduced…

We introduce a new class of fine compactified Jacobians for nodal curves, that we call fine compactified Jacobians of vine type, or simply fine V-compactified Jacobians. This class is strictly larger than the class of fine classical…

In this paper, we propose an improved algorithm for computing mod $\ell$ Galois representations associated to eigenforms of arbitrary levels prime to $\ell$. Precisely, we present a method to find the Jacobians of modular curves which have…

It was first pointed out by Weil that we can use classical invariant theory to compute the Jacobian of a genus one curve. The invariants required for curves of degree n = 2,3,4 were already known to the nineteenth centuary invariant…

In [5], without giving a detailed proof, Yamauchi provided a formula to calculate the genus of a certain family of smooth complete intersection algebraic curves. That formula is used extensively in [1] to study the algebraic curves for…

We introduce a common generalization of essentially all known methods for explicit computation of Selmer groups, which are used to bound the ranks of abelian varieties over global fields. We also simplify and extend the proofs relating what…

Topological properties of the jacobian curve ${\mathcal J}_{\mathcal{F},\mathcal{G}}$ of two foliations $\mathcal{F}$ and $\mathcal{G}$ are described in terms of invariants associated to the foliations. The main result gives a decomposition…

In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…

We show a direct calculation of Jacobian matrices in the old problems of rational curves on generic hypersurfaces.

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…