English
Related papers

Related papers: Explicit bounds on the coefficients of modular pol…

200 papers

We give explicit upper and lower bounds on the size of the coefficients of the modular polynomials $\Phi_N$ for the elliptic $j$-function. These bounds make explicit the best previously known asymptotic bounds. We then give an explicit…

Number Theory · Mathematics 2023-11-14 Florian Breuer , Desirée Gijón Gómez , Fabien Pazuki

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…

Number Theory · Mathematics 2025-10-17 Florian Breuer

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…

Number Theory · Mathematics 2026-01-27 Hiroshi Onuki , Yukihiro Uchida , Ryo Yoshizumi

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

Number Theory · Mathematics 2010-08-24 Joseph H. Silverman

For a fixed $j$-invariant $j_0$ of an elliptic curve without complex multiplication we bound the number of $j$-invariants $j$ that are algebraic units and such that elliptic curves corresponding to $j$ and $j_0$ are isogenous. Our bounds…

Number Theory · Mathematics 2019-08-30 Stefan Schmid

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

Number Theory · Mathematics 2023-06-06 Riccardo Invernizzi , Daniele Taufer

We show there exist polynomial bounds on torsion of elliptic curves which come from a fixed geometric isogeny class. More precisely, for an elliptic curve $E_0$ defined over a number field $F_0$, for each $\epsilon>0$ there exist constants…

Number Theory · Mathematics 2023-08-28 Tyler Genao

We show that for all epsilon > 0, there is a constant C(epsilon) > 0 such that for all elliptic curves E defined over a number field F with j(E) in Q we have #E(F)[tors] \leq C(epsilon)[F:Q]^{5/2+epsilon}. We pursue further bounds on the…

Number Theory · Mathematics 2017-05-31 Pete L. Clark , Paul Pollack

When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group…

Number Theory · Mathematics 2019-10-08 Robert J. Lemke Oliver , Frank Thorne

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

Numerical Analysis · Mathematics 2024-11-26 Prashant Batra

In this paper I prove a conjecture which gives a lower bound for the largest absolute value of the coefficients of the n-th cyclotomic polynomial for some n. Moreover this estimate is essentially sharp.

Number Theory · Mathematics 2024-03-21 Akos Borsanyi

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

We bound the j -invariant of integral points on a modular curve in terms of the congruence group defining the curve. We apply this to prove that the modular curve Xsplit (p3) has no non-trivial rational point if p is a sufficiently large…

Classical Analysis and ODEs · Mathematics 2016-10-05 Yuri Bilu , Pierre Parent

We investigate modularity of elliptic curves over a general totally real number field, establishing a finiteness result for the set non-modular $j$-invariants. By analyzing quadratic points on some modular curves, we show that all elliptic…

Number Theory · Mathematics 2013-09-18 Bao V. Le Hung

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

Number Theory · Mathematics 2020-11-09 M. J. Uray

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

Dynamical Systems · Mathematics 2022-02-08 Alexander Blokh , Lex Oversteegen , Vladlen Timorin

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…

Combinatorics · Mathematics 2010-04-21 Felix Breuer , Aaron Dall

The aim of this paper is to give a higher dimensional equivalent of the classical modular polynomials $\Phi_\ell(X,Y)$. If $j$ is the $j$-invariant associated to an elliptic curve $E_k$ over a field $k$ then the roots of $\Phi_\ell(j,X)$…

Symbolic Computation · Computer Science 2012-08-13 Jean-Charles Faugère , David Lubicz , Damien Robert

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

Computational Complexity · Computer Science 2015-05-19 Zhixiang Chen , Bin Fu
‹ Prev 1 2 3 10 Next ›