Related papers: Introducing Ramanujan's Class Polynomials in the G…
We explore a class of meromorphic functions on elliptic curves, termed \emph{elliptic orthogonal a-polynomials} ($a$-EOPs), which extend the classical notion of orthogonal polynomials to compact Riemann surfaces of genus one. Building on…
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…
Given two CM elliptic curves over a number field and a natural number $m$, we establish a polynomial lower bound (in terms of $m$) for the number of rational primes $p$ such that the reductions of these elliptic curves modulo a prime above…
We develop the Ercolani-Sinha construction of SU(2) monopoles and make this effective for (a five parameter family of centred) charge 3 monopoles. In particular we show how to solve the transcendental constraints arising on the spectral…
In this paper two important classes of orthogonal polynomials in higher dimensions using the framework of Clifford analysis are considered, namely the Clifford-Hermite and the Clifford-Gegenbauer polynomials. For both classes an explicit…
In this paper, we construct a family of elliptic curves of rank at least five. To do so, we use the Brahmagupta formula for the area of cyclic quadrilaterals $(p^3,q^3,r^3,q^3)$ not necessarily standing for the genuine sides of…
We find equations for the higher dimensional analogue of the modular curve X_0(3) using Mumford's algebraic formalism of algebraic theta functions. As a consequence, we derive a method for the construction of genus 2 hyperelliptic curves…
We study the simultaneous reductions at several supersingular primes of elliptic curves with complex multiplication. We show -- under additional congruence assumptions on the CM order -- that the reductions are surjective (and even become…
Using the rank of the Mordell-Weil group $E(\mathbb{Q})$ of an elliptic curve $E$ over $\mathbb{Q}$, we give a lower bound of the class number of the number field $\mathbb{Q}(E[p^n])$ generated by $p^n$-division points of $E$ when the curve…
The main result of this paper is to extend from $\Q$ to each of the nine imaginary quadratic fields of class number one a result of Serre (1987) and Mestre-Oesterl\'e (1989), namely that if $E$ is an elliptic curve of prime conductor then…
First we give general formulas for proving real or complex Ramanujan series for $1/\pi$. Then, as an example, we apply them for providing complete proofs of the fastest series for $1/\pi$ due to Ramanujan using Russell and Weber modular…
In this article we present evaluations of continued fractions studied by Ramanujan. More precisely we give the complete polynomial equations of Rogers-Ramanujan and other continued fractions, using tools from the elementary theory of the…
In this talk we discuss a class of Feynman integrals, which can be expressed to all orders in the dimensional regularisation parameter as iterated integrals of modular forms. We review the mathematical prerequisites related to elliptic…
We consider a particular case of an analog for elliptic curves to the Mersenne problem : finding explicitely all prime power terms in an elliptic divisibility sequence when descent via isogeny is possible. We explain how this question can…
We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where…
The recently introduced polynomial time integration framework proposes a novel way to construct time integrators for solving systems of first-order ordinary differential equation by using interpolating polynomials in the complex time plane.…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
We construct vertex transitive lattices on products of trees of arbitrary dimension $d \geq 1$ based on quaternion algebras over global fields with exactly two ramified places. Starting from arithmetic examples, we find non-residually…
We develop a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our method is based on a novel geometric construction, and reduces the total number of homotopy paths that must be…