Related papers: Modular polynomials for genus 2
We prove modularity of some two dimensional, 2-adic Galois representations over totally real fields that are nearly ordinary and that are residually dihedral. We do this by employing the strategy of Skinner and Wiles, using Hida families,…
We determine all genus 2 curves, defined over $\mathbb C$, which have simultaneously degree 2 and 3 elliptic subcovers. The locus of such curves has three irreducible 1-dimensional genus zero components in $\mathcal M_2$. For each component…
In this article, we study the Mahler measures of more than 500 families of reciprocal polynomials defining genus 2 and genus 3 curves. We numerically find relations between the Mahler measures of these polynomials with special values of…
We compute explicit rational models for some Hilbert modular surfaces corresponding to square discriminants, by connecting them to moduli spaces of elliptic K3 surfaces. Since they parametrize decomposable principally polarized abelian…
We study the modular curves defined by Weber functions, and associated modular polynomials, action of $\mathrm{SL}_2(\mathbb{Z})$, and parametrizations of elliptic curves with a view to the study of the isogeny graphs that they determine,…
This semi-expository paper discusses the log minimal model program as applied to the moduli space of curves, especially in the case of curves of genus two. Log canonical models for these moduli spaces can often be constructed using the…
We study genus 2 covers of relative elliptic curves over an arbitrary base in which 2 is invertible. Particular emphasis lies on the case that the covering degree is 2. We show that the data in the "basic construction" of genus 2 covers of…
This paper presents the theory of holomorphic vector valued modular forms from a geometric perspective. More precisely, we define certain holomorphic vector bundles on the modular orbifold of generalized elliptic curves whose sections are…
We show that the use of generalized multivariable forms of Hermite polynomials provide an useful tool for the evaluation of families of elliptic type integrals often encountered in electrostatic and electrodynamics
We define a modular function which is a generalization of the elliptic modular lambda function. We show this function and the modular invariant function generate the modular function field with respect to the principal congruence subgroup.…
In this paper we consider moduli spaces of coherent systems on an elliptic curve. We compute their Hodge polynomials and determine their birational types in some cases. Moreover we prove that certain moduli spaces of coherent systems are…
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…
The classical modular equations involve bivariate polynomials that can be seen to be univariate with coefficients in the modular invariant $j$. Kiepert found modular equations relating some $\eta$-quotients and the Weber functions…
The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…
Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
It is often stated that the Carlitz module is to the ring of univariate polynomials over a finite field what the multiplicative group is to the ring of integers. This analogy extends to the "rank 2" case, where Drinfeld modules play a role…
We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…