Related papers: On Division Polynomial PIT and Supersingularity

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) $y^{\prime}=p(y)$ over \emph{unbounded time domains}, where $p$ is a vector of polynomials. Contrarily to the bounded (compact) time…

We consider the problem of recovering (that is, interpolating) and identity testing of a "hidden" monic polynomial $f$, given an oracle access to $f(x)^e$ for $x\in{\mathbb F_q}$ (extension fields access is not permitted). The naive…

Let $p$ be an odd prime number, $E$ an elliptic curve defined over a number field. Suppose that $E$ has good reduction at any prime lying above $p$, and has supersingular reduction at some prime lying above $p$. In this paper, we construct…

Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…

For certain elliptic curves $E/\mathbb{Q}$ with $E(\mathbb{Q})[2]=\mathbb{Z}/2 \mathbb{Z}$, we prove a criterion for prime twists of $E$ to have analytic rank 0 or 1, based on a mod 4 congruence of 2-adic logarithms of Heegner points. As an…

Let $N>1$ and let $\Phi_N(X,Y)\in\mathbb{Z}[X,Y]$ be the modular polynomial which vanishes precisely at pairs of $j$-invariants of elliptic curves linked by a cyclic isogeny of degree $N$. In this note we study the divisibility of the…

Let $E/\mathbb{Q}$ be an elliptic curve and let $p$ be a prime of good supersingular reduction. Attached to $E$ are pairs of Iwasawa invariants $\mu_p^\pm$ and $\lambda_p^\pm$ which encode arithmetic properties of $E$ along the cyclotomic…

We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…

By reformulating and extending results of Elkies, we prove some results on $\mathbb Q$-curves over number fields of odd degree. We show that, over such fields, the only prime isogeny degrees~$\ell$ which an elliptic curve without CM may…

Let $E$ be an elliptic curve over a number field $K$ with at least one real embedding and $L$ be a finite extension of $K$. We generalize a result of Habegger to show that $L(E_{\text{tor}})$, the field generated by the torsion points of…

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

Fix an elliptic curve $E$ over $\mathbb Q$ of rank $1$. In this paper, we develop an explicit numerical criterion, comparable to Gold's criterion, that determines whether the Iwasawa invariants of the elliptic curve at a good (ordinary or…

For a pair $(E,P)$ of an elliptic curve $E/\mathbb{Q}$ and a nontorsion point $P\in E(\mathbb{Q})$, the sequence of \emph{elliptic Fermat numbers} is defined by taking quotients of terms in the corresponding elliptic divisibility sequence…

The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=\mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field $\mathbf{F}:=\mathbf{Z}_q$ of $q$…

Physics-Informed Neural Networks (PINNs) are a powerful class of numerical solvers for partial differential equations, employing deep neural networks with successful applications across a diverse set of problems. However, their…

In this talk we discuss Feynman integrals which are related to elliptic curves. We show with the help of an explicit example that in the set of master integrals more than one elliptic curve may occur. The technique of maximal cuts is a…

Let $\mathbb{F}_q$ denote a finite field of order $q$. A rational function $r(x)\in \mathbb{Q}(x)$ is said to be arithmetically exceptional if it induces a permutation on $\mathbb{P}^1(\mathbb{F}_p)$ for infinitely many primes $p$. Based on…