Related papers: Group Operation on Nodal Curves

Let $p$ be a prime number and let $k$ be an algebraically closed field of characteristic $p$. A $BT_1$ group scheme over $k$ is a finite commutative group scheme which arises as the kernel of $p$ on a $p$-divisible (Barsotti--Tate) group.…

Given a curve defined over an algebraically closed field which is complete with respect to a nontrivial valuation, we study its tropical Jacobian. This is done by first tropicalizing the curve, and then computing the Jacobian of the…

We study the Jacobian $J$ of the smooth projective curve $C$ of genus $r-1$ with affine model $y^r = x^{r-1}(x + 1)(x + t)$ over the function field $\mathbb{F}_p(t)$, when $p$ is prime and $r\ge 2$ is an integer prime to $p$. When $q$ is a…

Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…

We state two recent results concerning the linearization of integrable systems on generalised Jacobians. Then we apply this to the (complexified) spherical pendulum.

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 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…

We show that every irreducible, simply connected curve on a toric affine surface X over the field of complex numbers is an orbit closure of a multiplicative group action on X. It follows that up to the action of the automorphism group…

We give a general framework for uniform, constant-time one-and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the x-line or Kummer surface, where we can…

We explicitly construct the algebraic model of affine Jacobian of a generic algebraic curve of high genus and use it to compute the Euler characteristic of the Jacobian and investigate its structure.

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

We study the arithmetic of curves and Jacobians endowed with the action of a finite group $G$. This includes a study of the basic properties, as $G$-modules, of their $\ell$-adic representations, Selmer groups, rational points and…

We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…

We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…

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…

We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite…

We construct and study two series of curves whose Jacobians admit complex multiplication. The curves arise as quotients of Galois coverings of the projective line with Galois group metacyclic groups $G_{q,3}$ of order $3q$ with $q \equiv 1…

We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…

In the present paper we find a simple algorithm for counting Jacobian group of the generalized Petersen graph GP(n,k). Also, we obtain a closed formula for the number of spanning trees of this graph in terms of Chebyshev polynomials.

In this note we investigate the connection between polylogarithms on curves and abelian schemes. The main result shows that the polylogarithm on the abelian scheme can be obtained as the push-forward of the polylogarithm on a suitable…