相关论文: Efficient computation of p-adic heights

We provide an algorithm for computing the Euler characteristic of the curves $S_p$ in the space of cubic polynomials, consisting of all polynomials with a periodic critical point of period $p$. The curves were introduced in [Milnor,…

This paper is devoted to the study of the $\ell$-adic representations of the absolute Galois group $G$ of ${\mathbb Q}_p$, $p\geq 5$, associated to an elliptic curve over ${\mathbb Q}_p$, as $\ell$ runs through the set of all prime numbers…

The modularity of elliptic curves always intrigues number theorists. Recently, Thorne had proved a marvelous result that for a prime $ p $, every elliptic curve defined over a $ p $-cyclotomic extension of $ \mathbb{Q} $ is modular. The…

We study the interaction between the group law on an elliptic curve and the additive structure of $x$-coordinates of rational points on an elliptic curve. Let $E/\mathbb{Q}$ be an elliptic curve of Mordell-Weil rank $r \geq 1$, $d \geq 1$…

Let E/Q be an elliptic curve with good supersingular reduction at p with a_p(E)=0. We give a conjecture on the existence of analytic plus and minus p-adic L-functions of E over the Zp-cyclotomic extension of a finite Galois extension of Q…

We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…

Gradient estimation is a central challenge in training parameterized quantum circuits (PQCs) for hybrid quantum-classical optimization and learning problems. This difficulty arises from several factors, including the exponential…

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

For $n\geq 2$, let $K=\overline{\mathbb{Q}}(\mathbb{P}^n)=\overline{\mathbb{Q}}(T_1, \ldots, T_n)$. Let $E/K$ be the elliptic curve defined by a minimal Weiestrass equation $y^2=x^3+Ax+B$, with $A,B \in \overline{\mathbb{Q}}[T_1, \ldots,…

We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…

We derive computable error estimates for finite element approximations of linear elliptic partial differential equations (PDE) with rough stochastic coefficients. In this setting, the exact solutions contain high frequency content that…

We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$. For a quadratic number field $K$ and an odd prime number $p$, let $L$ be a $\mathbb{Z}_p$-extension of $K$. We prove that $E(L)_{\text{tors}}=E(K)_{\text{tors}}$ when $p>5$. It enables…

The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…

An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.

Given two points in a simple polygon $P$ of $n$ vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within $P$. The geodesic center of $P$ is the unique point in $P$ that minimizes…

We present an algorithm for the construction of lower dimensional elliptic tori in parametric Hamiltonian systems by means of the parametrization method with the tangent and normal frequencies being prescribed. This requires that the…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

Let $E$ be an elliptic curve over $\mathbb{Q}$ which has multiplicative reduction at a fixed prime $p$. For each positive integer $n$ we put $K_n:=\mathbb{Q}(E[p^n])$. The aim of this paper is to extend the author's previous our results…

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…