English
Related papers

Related papers: Heuristics on pairing-friendly elliptic curves

200 papers

We prove an asymptotic formula for the number of ${\rm SL}_3({\mathbb Z})$-equivalence classes of integral ternary cubic forms having bounded invariants. We use this result to show that the average size of the 3-Selmer group of all elliptic…

Number Theory · Mathematics 2013-12-25 Manjul Bhargava , Arul Shankar

We show how the Weil pairing can be used to evaluate the assigned characters of an imaginary quadratic order $\mathcal{O}$ in an unknown ideal class $[\mathfrak{a}] \in \mathrm{Cl}(\mathcal{O})$ that connects two given…

Number Theory · Mathematics 2022-10-05 Wouter Castryck , Marc Houben , Frederik Vercauteren , Benjamin Wesolowski

Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…

Geometric Topology · Mathematics 2025-10-28 Nicolau C. Saldanha , Pedro Zühlke

An abelian variety admits only a finite number of isomorphism classes of principal polarizations. The paper gives an interpretation of this number in terms of class numbers of definite Hermitian forms in the case of a product of elliptic…

Algebraic Geometry · Mathematics 2007-05-23 Herbert Lange

For a given elliptic curve $E/\mathbb{Q}$, let $N_p(E)$ be the number of points on $E$ modulo $p$ for a prime of good reduction for $E$. Given integer $n$, let $G_k(E,n)$ be the number of $k$-tuples of $p_1<p_2<\ldots <p_k$ primes of good…

Number Theory · Mathematics 2026-01-22 Kirti Joshi

The main goal of this paper is to determine for which prime numbers $r\geq 3$ can an elliptic curve~$E$ defined over $\mathbb Q$ have an $r$-isogeny over $\mathbb Q(\zeta_r)$. We study this question under various assumptions on the…

Number Theory · Mathematics 2024-06-06 Filip Najman

This paper concentrates on the quantitative homogenization of higher-order elliptic systems with almost-periodic coefficients in bounded Lipschitz domains. For coefficients which are almost-periodic in the sense of H. Weyl, we establish…

Analysis of PDEs · Mathematics 2020-01-30 Yao Xu , Weisheng Niu

For an elliptic curve $E$ over a number field $K$, one consequence of the Birch and Swinnerton-Dyer conjecture is the parity conjecture: the global root number matches the parity of the Mordell-Weil rank. Assuming finiteness of…

Number Theory · Mathematics 2014-04-09 Kȩstutis Česnavičius

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

Combinatorics · Mathematics 2024-11-15 David Clancy

We determine all possible degrees of cyclic isogenies of non-CM elliptic curves with rational $j$-invariant over number fields of degree $p$, where $p$ is an odd prime. The question had been answered for $p=2$, so this paper completes the…

Number Theory · Mathematics 2024-11-06 Ivan Novak

Let $R$ be a complete discrete valuation ring with fraction field $K$ and perfect residue field $k$ of characteristic $p>0$. Let $E/K$ be an elliptic curve with a $K$-rational isogeny of prime degree $\ell$. In this article, we study the…

Number Theory · Mathematics 2024-04-18 Mentzelos Melistas

Fix an elliptic curve E over Q. An extremal prime for E is a prime p of good reduction such that the number of rational points on E modulo p is maximal or minimal in relation to the Hasse bound. Assuming that all the symmetric power…

Number Theory · Mathematics 2019-07-02 C. David , A. Gafni , A. Malik , N. Prabhu , C. L. Turnage-Butterbaugh

This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common…

Computational Geometry · Computer Science 2020-09-03 Jyh-Ming Lien , Vikram Sharma , Gert Vegter , Chee Yap

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…

Symbolic Computation · Computer Science 2015-03-19 Michael Kerber , Michael Sagraloff

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…

Number Theory · Mathematics 2018-02-28 Fumio Sairaiji , Takuya Yamauchi

In recent years, the question of whether the ranks of elliptic curves defined over $\mathbb{Q}$ are unbounded has garnered much attention. One can create refined versions of this question by restricting one's attention to elliptic curves…

Number Theory · Mathematics 2024-12-12 Harris B. Daniels , Hannah Goodwillie

Let $E:y^2=(x-e_1)(x-e_2)(x-e_3)$ be a nonconstant elliptic curve over $\mathbb{Q}(t)$, where $e_j\in \mathbb{Z}[t]$. We describe a method for finding a specialization $t\mapsto t_0\in\mathbb{Q}$ such that the specialization homomorphism is…

Number Theory · Mathematics 2012-11-19 Ivica Gusic , Petra Tadic

Given an elliptic curve $E$ defined over $\mathbb{Q}$ without complex multiplication, we provide an explicit sharp bound on the index of the image of the adelic representation $\rho_E$. In particular, if $\operatorname{h}_{\mathcal{F}}(E)$…

Number Theory · Mathematics 2026-03-02 Lorenzo Furio

We present a simple numerical algorithm for solving elliptic equations where the diffusion coefficient, the source term, the solution and its flux are discontinuous across an irregular interface. The algorithm produces second-order accurate…

Computational Physics · Physics 2023-09-26 Daniil Bochkov , Frederic Gibou

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…

Cryptography and Security · Computer Science 2023-01-18 Razvan Barbulescu , Florent Jouve
‹ Prev 1 8 9 10 Next ›