English
Related papers

Related papers: Extending Lenstra's Primality Test to CM elliptic …

200 papers

We study the prime number race for elliptic curves over the function field of a proper, smooth and geometrically connected curve over a finite field. This constitutes a function field analogue of prior work by Mazur, Sarnak and the second…

Number Theory · Mathematics 2015-03-10 Byungchul Cha , Daniel Fiorilli , Florent Jouve

We prove the analyticity of smooth critical points for generalized integral Menger curvature energies $\mathrm{intM}^{(p,2)}$, with $p \in (\tfrac 73, \tfrac 83)$, subject to a fixed length constraint. This implies, together with already…

Analysis of PDEs · Mathematics 2022-03-31 Daniel Steenebrügge , Nicole Vorderobermeier

In this work, we develop new insights into the fundamental problem of convexity testing of real-valued functions over the domain $[n]$. Specifically, we present a nonadaptive algorithm that, given inputs $\eps \in (0,1), s \in \mathbb{N}$,…

Data Structures and Algorithms · Computer Science 2021-10-26 Abhiruk Lahiri , Ilan Newman , Nithin Varma

We prove that many representations $\overline{\rho} : \operatorname{Gal}(\overline{K} / K) \to \operatorname{GL}_2(\mathbb{F}_3)$, where $K$ is a CM field, arise from modular elliptic curves. We prove similar results when the prime $p = 3$…

Number Theory · Mathematics 2022-09-05 Patrick B. Allen , Chandrashekhar Khare , Jack A. Thorne

Robert Denomme and Gordan Savin made a primality test for Fermat numbers 2^(2^k)+1 using elliptic curves. We propose another primality test using elliptic curves for Fermat numbers and also give primality tests for integers of the form…

Number Theory · Mathematics 2009-12-14 Yu Tsumura

This paper provides parametric and rank-based optimal tests for eigenvectors and eigenvalues of covariance or scatter matrices in elliptical families. The parametric tests extend the Gaussian likelihood ratio tests of Anderson (1963) and…

Statistics Theory · Mathematics 2012-11-12 Marc Hallin , Davy Paindaveine , Thomas Verdebout

An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…

Number Theory · Mathematics 2015-05-13 Graham Everest , Patrick Ingram , Valery Mahe , Shaun Stevens

We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^O(n) for general norms and nearly matching the bound of…

Computational Complexity · Computer Science 2011-07-28 Daniel Dadush , Santosh Vempala

For an elliptic curve $E$ over a local field $K$ and a separable quadratic extension of $K$, motivated by connections to the Birch and Swinnerton-Dyer conjecture, Kramer and Tunnell have conjectured a formula for computing the local root…

Number Theory · Mathematics 2019-02-20 Kestutis Cesnavicius , Naoki Imai

Let $C$ be a smooth projective irreducible curve defined over a finite field $\mathbb{F}_q$ and $K=\mathbb{F}_q(C)$. Let $A\subset K$ be the ring of functions regular outside a fixed place $\infty$ of $K$. Let…

Number Theory · Mathematics 2016-09-07 Amilcar Pacheco

We prove existence and up to the boundary regularity estimates in $L^{p}$ and H\"{o}lder spaces for weak solutions of the linear system $$ \delta \left( A d\omega \right) + B^{T}d\delta \left( B\omega \right) = \lambda B\omega + f \text{ in…

Analysis of PDEs · Mathematics 2025-04-02 Swarnendu Sil

Let $E$ be a CM elliptic curve over $\Bbb{Q}$. We refine the work of Cojocaru on the asymptotic formulae for the number of primes $p\le x$ for which the reduction modulo $p$ of $E$ is of square-free order. Also, we derive an unconditional…

Number Theory · Mathematics 2025-10-30 Peng-Jie Wong

Primality testing is an especially useful topic for public-key cryptography. In this paper, a novel primality test algorithm based on the Pell's cubic will be introduced, and its necessary primality conditions will be proved using three…

Number Theory · Mathematics 2024-11-05 Luca Di Domenico , Nadir Murru

In this manuscript we study geometric regularity estimates for quasi-linear elliptic equations of $p$-Laplace type ($1 < p< \infty$) with strong absorption condition: $$ -\text{div}\,(\Phi(x, u, \nabla u)) + \lambda_0(x) u_{+}^q(x) = 0…

Analysis of PDEs · Mathematics 2025-01-23 João Vítor da Silva , Ariel Salort

It is believed that, in the limit as the conductor tends to infinity, correlations between the zeros of elliptic curve $L$-functions averaged within families follow the distribution laws of the eigenvalues of random matrices drawn from the…

Number Theory · Mathematics 2008-11-17 D. K. Huynh , J. P. Keating , N. C. Snaith

We study the finiteness of low degree points on certain modular curves and their Atkin--Lehner quotients, and, as an application, prove the modularity of elliptic curves over all but finitely many totally real fields of degree $5$. On the…

Number Theory · Mathematics 2022-10-18 Yasuhiro Ishitsuka , Tetsushi Ito , Sho Yoshikawa

This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields $K$, where $K$ can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which…

Cryptography and Security · Computer Science 2014-08-27 Abdoul Aziz Ciss

A famous formula of Rodriguez Villegas shows that the Mahler measures $m(k)$ of $P_k(x,y)=x+1/x+y+1/y+k$ can be written as a Kronecker-Eisenstein series. We prove that the degree of $k$ in Villegas' formula can be bounded by the class…

Number Theory · Mathematics 2024-02-06 Zhengyu Tao , Xuejun Guo , Tao Wei

Following Katz-Sarnak, Iwaniec-Luo-Sarnak, and Rubinstein, we use the 1- and 2-level densities to study the distribution of low lying zeros for one-parameter rational families of elliptic curves over Q(t). Modulo standard conjectures, for…

Number Theory · Mathematics 2010-11-16 Steven J. Miller

We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion,…

Quantum Physics · Physics 2011-09-12 Andris Ambainis , Andrew M. Childs , Yi-Kai Liu