Related papers: Introducing Ramanujan's Class Polynomials in the G…

We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…

For modular elliptic curves over number fields of narrow class number one, and with multiplicative reduction at a collection of p-adic primes, we define new p-adic invariants. Inspired by Nekovar and Scholl's plectic conjectures, we believe…

The Ramanujan polynomials arise in three intertwined contexts. As remarked by BerndtEvans-Wilson, no combinatorial perspective seems to be alluded to in the original definition of Ramanujan. On a different stage, Dumont-Ramamonjisoa…

We solve the problem of the computation of the orbifold Euler characteristics of $\Mbar_{g,n}$. We take the works of Harer-Zagier \cite{hz} and Bini-Harer \cite{bh} as our starting point, and apply the formalisms developed in \cite{wz} and…

Many rationally parametrized elliptic modular equations are derived. Each comes from a family of elliptic curves attached to a genus-zero congruence subgroup $\Gamma_0(N)$, as an algebraic transformation of elliptic curve periods,…

In this work, we consider rational ordinary differential equations dy/dx = Q(x,y)/P(x,y), with Q(x,y) and P(x,y) coprime polynomials with real coefficients. We give a method to construct equations of this type for which a first integral can…

We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…

For a hyperelliptic curve of genus $g$, a divisor in general position of degree $g+1$ is given by polynomial equations. There is an action from an algebraic group on the representations of divisors by polynomials which fixes divisor…

We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…

The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…

We review certain classes of iterated integrals that appear in the computation of Feynman integrals that involve elliptic functions. These functions generalise the well-known class of multiple polylogarithms to elliptic curves and are…

The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…

Using equidistribution criteria, we establish divisibility by cyclotomic polynomials of several partition polynomials of interest, including $spt$-crank, overpartition pairs, and $t$-core partitions. As corollaries, we obtain new proofs of…

We consider semiclassical orthogonal polynomials on the unit circle associated with a weight function that satisfy a Pearson-type differential equation involving two polynomials of degree at most three. Structure relations and difference…

The study of Fourier coefficients of meromorphic modular forms dates back to Ramanujan, who, together with Hardy, studied the reciprocal of the weight 6 Eisenstein series. Ramanujan conjectured a number of further identities for other…

Extending the former work for the good reduction case, we provide a numerical criterion to verify a large portion of the "Iwasawa main conjecture without $p$-adic $L$-functions" for elliptic curves with additive reduction at an odd prime…

We present a deterministic and explicit algorithm to compute the endomorphism rings of supersingular elliptic curves. As an example we compute the endomorphism rings of all supersingular elliptic curves defined over characteristic…

Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…

We give algorithms for computing the singular moduli of suitable nonholomorphic modular functions F(z). By combining the theory of isogeny volcanoes with a beautiful observation of Masser concerning the nonholomorphic Eisenstein series…

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…