Related papers: The quadratic character experiment

Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…

We study the local statistics of zeros of $L$-functions attached to Artin-Scheier curves over finite fields. We consider three families of Artin-Schreier $L$-functions: the ordinary, polynomial (the $p$-rank 0 stratum) and odd-polynomial…

We address the asymptotic and approximate distributions of a large class of test statistics with quadratic forms used in association studies. The statistics of interest do not necessarily follow a chi-square distribution and take the…

Consider systems of equations $q_i(x)=0$, where $q_i: {\Bbb R}^n \longrightarrow {\Bbb R}$, $i=1, \ldots, m$, are quadratic forms. Our goal is to tell efficiently systems with many non-trivial solutions or near-solutions $x \ne 0$ from…

The well-known Caputo fractional derivative and the corresponding Caputo fractional integral occur naturally in many equations that model physical phenomena under inhomogeneous media. The relationship between the two fractional terms can be…

We prove some new log-free density theorems for zeros of Dirichlet L-functions (which accordingly are more sharp than earlier ones near to the boundary line of the critical strip). The results can be applied in several problems of prime…

The compensated quotient-difference (Compqd) algorithm is proposed along with some applications. The main motivation is based on the fact that the standard quotient-difference (qd) algorithm can be numerically unstable. The Compqd algorithm…

Functions are a fundamental object in mathematics, with countless applications to different fields, and are usually classified based on certain properties, given their domains and images. An important property of a real-valued function is…

We obtain transformation formulas for quadratic character sums with quartic and cubic polynomial arguments.

In this paper, we further develop the approach, originating in [14 (arXiv:1311.6765),20 (arXiv:1604.02576)], to "computation-friendly" hypothesis testing and statistical estimation via Convex Programming. Specifically, we focus on…

In the classical theory of $L$-series, the exact order (of zero) at a trivial zero is easily computed via the functional equation. In the characteristic $p$ theory, it has long been known that a functional equation of classical $s\mapsto…

An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…

We consider the entire characteristic functions of order 2 and we prove some decomposition theorems in a multidimensional case. We show that the lack of zeros of the density function is a necessary but not a sufficient (as in the…

In this document, as far as the authors know, an approximation to the zeros of the Riemann zeta function has been obtained for the first time using only derivatives of constant functions, which was possible only because a fractional…

We prove several results about integers represented by positive definite quadratic forms, using a Fourier analysis approach. In particular, for an integer $\ell\geq 1$, we improve the error term in the partial sums of the number of…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

We prove certain polynomial relations between the values of complex irreducible characters of general finite symmetric groups. We use it to find some sets of conjugacy classes such that no finite symmetric group has a complex irreducible…

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…