SearcharxivSearch

arXiv subjects

Alexander Shashkov

Publications and source records attributed to Alexander Shashkov.

5 recordsLinked to original sources

Low lying zeros of Rankin-Selberg $L$-functions

We study the low lying zeros of $GL(2) \times GL(2)$ Rankin-Selberg $L$-functions. Assuming the generalized Riemann hypothesis, we compute the $1$-level density of the low-lying zeroes of $L(s, f \otimes g)$ averaged over families of Rankin-Selberg convolutions, where $f, g$ are cuspidal newforms with even weights $k_1, k_2$ and prime levels $N_1, N_2$, respectively. The Katz-Sarnak density conjecture predicts that in the limit, the $1$-level density of suitable families of $L$-functions is the same as the distribution of eigenvalues of corresponding families of random matrices. The 1-level density relies on a smooth test function $\phi$ whose Fourier transform $\widehat\phi$ has compact support. In general, we show the Katz-Sarnak density conjecture holds for test functions $\phi$ with $\operatorname{supp} \widehat\phi \subset (-\frac{1}{2}, \frac{1}{2})$. When $N_1 = N_2$, we prove the density conjecture for $\operatorname{supp} \widehat\phi \subset (-\frac{5}{4}, \frac{5}{4})$ when $k_1 \ne k_2$, and $\operatorname{supp} \widehat\phi \subset (-\frac{29}{28}, \frac{29}{28})$ when $k_1 = k_2$. A lower order term emerges when the support of $\widehat\phi$ exceeds $(-1, 1)$, which makes these results particularly interesting. The main idea which allows us to extend the support of $\widehat\phi$ beyond $(-1, 1)$ is an analysis of the products of Kloosterman sums arising from the Petersson formula. We also carefully treat the contributions from poles in the case where $k_1 = k_2$. Our work provides conditional lower bounds for the proportion of Rankin-Selberg $L$-functions which are non-vanishing at the central point and for a related conjecture of Keating and Snaith on central $L$-values.

math.NT

Modular forms and an explicit Chebotarev variant of the Brun-Titchmarsh theorem

We prove an explicit Chebotarev variant of the Brun--Titchmarsh theorem. This leads to explicit versions of the best-known unconditional upper bounds toward conjectures of Lang and Trotter for the coefficients of holomorphic cuspidal newforms. In particular, we prove that $$\lim_{x \to \infty} \frac{\#\{1 \leq n \leq x \mid \tau(n) \neq 0\}}{x} > 1-1.15 \times 10^{-12},$$ where $\tau(n)$ is Ramanujan's tau-function. This is the first known positive unconditional lower bound for the proportion of positive integers $n$ such that $\tau(n) \neq 0$.

math.NT

On the moments of one-level densities in families of holomorphic cusp forms in the level aspect

We study the $n^{\rm th}$ centered moments of the $1$-level density for the low-lying zeros of $L$-functions attached to holomorphic cuspidal newforms of large prime level and fixed weight. Assuming the Generalized Riemann Hypotheses, we compute this statistic for any $n\ge 1$ and for all test functions whose Fourier transforms are supported in $\left(-2/n, \, 2/n\right)$. This is believed to be the natural limit of the current technology. Our work significantly extends beyond the trivial range $(-1/n, \, 1/n)$ and surpasses the previous record of $(-1/(n-1),\, 1/(n-1))$ whenever $n>2$. The Katz-Sarnak philosophy predicts that the aforementioned statistic can be modeled by the corresponding statistic for the eigenvalues of random orthogonal matrices. We prove that this is the case for test functions with Fourier support contained in $(-2/n,\, 2/n)$. The main technical innovation is a tractable vantage to evaluate the combinatorial zoo of terms, similar to the work of Conrey-Snaith and Mason-Snaith. As an application, our work provides better bounds on the order of vanishing at the central point for the $L$-functions in our family.

math.NT

Limiting Spectral Distributions of Families of Block Matrix Ensembles

We introduce a new matrix operation on a pair of matrices, $\text{swirl}(A,X),$ and discuss its implications on the limiting spectral distribution. In a special case, the resultant ensemble converges almost surely to the Rayleigh distribution. In proving this, we provide a novel combinatorial proof that the random matrix ensemble of circulant Hankel matrices converges almost surely to the Rayleigh distribution, using the method of moments.

math.PR

Garland Recurrences

Partially ordered sets have received much attention in recent years, not just due to their usefulness in combinatorics and abstract algebra, but also due to their practical applications in fields ranging from chemistry to macroeconomics. The garland or double fence $G_N$ is a partially ordered set with $2N$ elements which generalizes the well-known fence or zigzag poset. The main result of this paper is recurrence relations for enumerating the linear extensions of $G_N$. These recurrences were then applied to prove divergence of the standard type $G_N$-generating series. When coded in Python, it provides a fast method for computing $e(G_n)$ for arbitrary $n$. The first 200 terms of this sequence are published online under OEIS A227656.

math.CO