Related papers: Computing $L$-functions with large conductor
We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1-13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.
Let $f$ be a fixed (holomorphic or Maass) modular cusp form, with $L$-function $L(f,s)$. We describe an algorithm that computes the value $L(f,1/2+ iT)$ to any specified precision in time $O(1+|T|^{7/8})$.
We present a method for the numerical calculation of derivatives of functions of general complex matrices. The method can be used in combination with any algorithm that evaluates or approximates the desired matrix function, in particular…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
For r=6,7,...,11 we find an elliptic curve E/Q of rank at least r and the smallest conductor known, improving on the previous records by factors ranging from 1.0136 (for r=6) to over 100 (for r=10 and r=11). We describe our search methods,…
In this paper we describe a condition under which a given function that commute with an idempotent function on an infinite set is a Cayley function using its functional digraph.
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
An algorithm for solving the random resistor problem by means of the transfer-matrix approach is presented. Preconditioning by spanning clusters extraction both reduces the size of the conductivity matrix and speed up the calculations.
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function.
In this paper, we express special values of the $L$-functions of certain CM elliptic curves which are related to Fermat curves in terms of the special values of generalized hypergeometric functions by comparing Bloch's element with Ross's…
In this article, we will consider second order uniformly elliptic operators of divergence form defined on R^n with measurable coefficients. Mainly, we will give estimates on the dimension of space of solutions that grow at most polynomially…
Assuming the Generalized Riemann Hypothesis (GRH), we utilize the long resonator method to derive $\Omega$-results for the family of quadratic Dirichlet $L$-functions $L(\sigma, \chi_d)$, where $d$ runs over all fundamental discriminants…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
We provide a generating function for the (graded) dimensions of M. Kontsevich's graph complexes of ordinary graphs. This generating function can be used to compute the Euler characteristic in each loop order. Furthermore, we show that…
We construct plane models of the modular curve $X_H(\ell)$, and use their explicit equations to compute Galois representations associated to modular forms for values of $\ell$ that are significantly higher than in prior works.
We study the elliptic maximal functions defined by averages over ellipses and rotated ellipses which are multi-parametric variants of the circular maximal function. We prove that those maximal functions are bounded on $L^p$ for some $p\neq…
We calculate effective impedances of infinite $LC$- and $CL$- ladder networks as limits of effective impedances of finite network approximations, using a new method, which involves precise mathematical concepts. These concepts are related…
Diffusing a graph signal at multiple scales requires computing the action of the exponential of several multiples of the Laplacian matrix. We tighten a bound on the approximation error of truncated Chebyshev polynomial approximations of the…