English
Related papers

Related papers: Using the Charlap-Coley-Robbins polynomials for co…

200 papers

Consider two elliptic curves $E,E'$ defined over the finite field $\mathbb{F}_q$, and suppose that there exists an isogeny $\psi$ between $E$ and $E'$. We propose an algorithm that determines $\psi$ from the knowledge of $E$, $E'$ and of…

Algebraic Geometry · Mathematics 2019-02-20 Luca De Feo , Cyril Hugounenq , Jérôme Plût , Éric Schost

Let $\ell$ be an odd prime, and suppose $E$ is an elliptic curve defined over the rational numbers $\mathbb{Q}$. If $E$ has an $\ell$-torsion point, then there has been significant work done on characterizing the $\ell$-divisibility of the…

Number Theory · Mathematics 2024-08-08 Alexander Barrios , John Cullinan

Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…

Number Theory · Mathematics 2026-04-20 Katherine E. Stange

We investigate a problem considered by Zagier and Elkies, of finding large integral points on elliptic curves. By writing down a generic polynomial solution and equating coefficients, we are led to suspect four extremal cases that still…

Number Theory · Mathematics 2009-03-10 Mark Watkins , Noam D. Elkies

Modular polynomials are an important tool in many algorithms involving elliptic curves. In this article we investigate their generalization to the genus 2 case following pioneering work by Gaudry and Dupont. We prove various properties of…

Number Theory · Mathematics 2009-02-04 Reinier Broker , Kristin Lauter

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…

Algebraic Geometry · Mathematics 2020-09-28 Élie Eid

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…

Number Theory · Mathematics 2017-07-26 Christian J. Berghoff

We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…

Number Theory · Mathematics 2025-02-28 Stefano Marseglia

Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…

Quantum Physics · Physics 2022-05-25 Arturas Acus , Adolfas Dargys

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

Number Theory · Mathematics 2023-11-07 Alp Bassa , Gaetan Bisson , Roger Oyono

We provide explicit bounds on the difference of heights of the $j$-invariants of isogenous elliptic curves defined over $\overline{\mathbb{Q}}$. The first one is reminiscent of a classical estimate for the Faltings height of isogenous…

Number Theory · Mathematics 2019-02-28 Fabien Pazuki

For each $t\in\mathbb{Q}\setminus\{-1,0,1\}$, define an elliptic curve over $\mathbb{Q}$ by \begin{align*} E_t:y^2=x(x+1)(x+t^2). \end{align*} Using a formula for the root number $W(E_t)$ as a function of $t$ and assuming some standard…

Number Theory · Mathematics 2023-10-05 Jonathan Love

Conjectural results for cohomological invariants of wild character varieties are obtained by counting curves in degenerate Calabi-Yau threefolds. A conjectural formula for E-polynomials is derived from the Gromov-Witten theory of local…

Algebraic Geometry · Mathematics 2017-05-22 Duiliu-Emanuel Diaconescu

Let $p$ be an odd prime number and let $X_0^+(p)$ be the quotient of the classical modular curve $X_0(p)$ by the action of the Atkin-Lehner operator $w_p$. In this paper we show how to compute explicit equations for the canonical model of…

Number Theory · Mathematics 2016-07-18 Pietro Mercuri

For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th…

Symbolic Computation · Computer Science 2018-01-17 Javad Doliskani

The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…

Number Theory · Mathematics 2022-09-30 Marc Houben , Marco Streng

Fix a prime number $\ell$. Graphs of isogenies of degree a power of $\ell$ are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a…

Number Theory · Mathematics 2016-10-03 Ernest Hunter Brooks , Dimitar Jetchev , Benjamin Wesolowski

Let $E / \mathbb{Q}$ and $A / \mathbb{Q}$ be elliptic curves. We can construct modular points derived from $A$ via the modular parametrisation of $E$. With certain assumptions we can show that these points are of infinite order and are not…

Number Theory · Mathematics 2021-01-08 Richard Hatton

We study quotients of principally polarized abelian varieties with real multiplication by Galois-stable finite subgroups and describe when these quotients are principally polarizable. We use this characterization to provide an algorithm to…

Number Theory · Mathematics 2020-10-01 Alina Dudeanu , Dimitar Jetchev , Damien Robert , Marius Vuille

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

Number Theory · Mathematics 2021-03-30 Reinier Broker , Peter Stevenhagen