Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2001.03242

Zeroes of quaternionic modular forms and central $L$-values

Kimball Martin·Jordan Wiebe
View original source ↗Read source document ↗Export metadata ↓

Abstract

Values of quaternionic modular forms are related to twisted central $L$-values via periods and a theorem of Waldspurger. In particular, certain twisted $L$-values must be non-vanishing for forms with no zeroes. Here we study, theoretically and computationally, zeroes of definite quaternionic modular forms of trivial weight. Local sign conditions force certain forms to have trivial zeroes, but we conjecture that almost all forms have no nontrivial zeroes. In particular, almost all forms with appropriate local signs should have no zeroes. We show these conjectures follow from a conjecture on the average number of Galois orbits, and give applications to (non)vanishing of $L$-values.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kimball Martin, Jordan Wiebe. 2020-06-18. Zeroes of quaternionic modular forms and central $L$-values. https://doi.org/10.1016/j.jnt.2020.05.008

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗