Search arXivSearch

arXiv · 2203.07606

Distribution of toric periods of modular forms on definite quaternion algebras

Abstract

Let $D$ be a definite quaternion algebra over $\mathbb{Q}$ and $\mathcal{O}$ an Eichler order in $D$ of square-free level. We study distribution of the toric periods of algebraic modular forms of level $\mathcal{O}$. We focus on two problems: non-vanishing and sign changes. Firstly, under certain conditions on $\mathcal{O}$, we prove the non-vanishing of the toric periods for positive proportion of imaginary quadratic fields. This improves the known lower bounds toward Goldfeld's conjecture in some cases and provides evidence for similar non-vanishing conjectures for central values of twisted automorphic $L$-functions. Secondly, we show that the sequence of toric periods has infinitely many sign changes. This proves the sign changes of the Fourier coefficients $\{a(n)\}_n$ of weight 3/2 modular forms, where $n$ ranges over fundamental discriminants. In the final section, we present numerical experiments in some cases and formulate several conjectures based on them.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miyu Suzuki, Satoshi Wakatsuki, Shun'ichi Yokoyama. 2022-09-08. Distribution of toric periods of modular forms on definite quaternion algebras. https://doi.org/10.1007/s40993-022-00389-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT