Related papers: The quadratic character experiment

It is believed that, in the limit as the conductor tends to infinity, correlations between the zeros of elliptic curve $L$-functions averaged within families follow the distribution laws of the eigenvalues of random matrices drawn from the…

We give a sufficient condition for the existence of a quadratic exponential vector with test function in L2(Rd) ? L?(Rd). We prove the linear independence and totality, in the quadratic Fock space, of these vectors. Using a technique…

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…

We describe two new algorithms for the efficient and rigorous computation of Dirichlet L-functions and their use to verify the Generalised Riemann Hypothesis for all such L-functions associated with primitive characters of modulus…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \log N)$ multiplications and $O(\log N)$ active memory. The method does not require evaluations of the…

We study, on average over f, zeros of the L-functions of primitive weight two forms of level q (fixed). We prove, on the one hand, density theorems for the zeros (similar to the results of Bombieri, Jutila, Motohashi, Selberg in the case of…

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

We compute the quark number susceptibilities in two flavor QCD for staggered fermions by adding the chemical potential as a Lagrange multiplier for the point-split number density term. Since lesser number of quark propagators are required…

We obtain nontrivial estimates of quadratic character sums of division polynomials $\Psi_n(P)$, $n=1,2, ...$, evaluated at a given point $P$ on an elliptic curve over a finite field of $q$ elements. Our bounds are nontrivial if the order of…

We prove that any function with real-valued coefficients, whose input is 4 binary variables and whose output is a real number, is perfectly equivalent to a quadratic function whose input is 5 binary variables and is minimized over the new…

We report on some extensive computations and experiments concerning the moments of quadratic Dirichlet $L$-functions at the critical point. We computed the values of $L(1/2,\chi_d)$ for $- 5\times 10^{10} < d < 1.3 \times 10^{10}$ in order…

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…

In an earlier paper [4], we derived asymptotic formulas for the number of representations of zero and of large positive integers by the cubic forms in seven variables which can be written as $L_1(x_1,x_2,x_3) Q_1(x_1,x_2,x_3)+…

The q-characters of quantum loop algebras are very important objects in representation theory. In [20], we showed that q-characters factor as a power series of the form studied in [9] times a character, an important phenomenon which had…

A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity…

We introduce a family of L-series specialising to both L-series associated to certain Dirichlet characters over F_q[T] and to integral values of Carlitz-Goss zeta function associated to F_q[T]. We prove, with the use of the theory of…

Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…

In upcoming papers by Conrey, Farmer and Zirnbauer there appear conjectural formulas for averages, over a family, of ratios of products of shifted L-functions. In this paper we will present various applications of these ratios conjectures…

The Ratios Conjecture of Conrey, Farmer and Zirnbauer predicts the answers to numerous questions in number theory, ranging from n-level densities and correlations to mollifiers to moments and vanishing at the central point. The conjecture…