Search arXivSearch

arXiv · 2005.02017

Zeta functions and nonvanishing theorems for toric periods on $\mathrm{GL}_2$

Abstract

Let $F$ be a number field and $D$ a quaternion algebra over $F$. Take a cuspidal automorphic representation $π$ of $D_\mathbb{A}^\times$ with trivial central cahracter. We study the zeta functions with period integrals on $π$ for the perhomogeneous vector space $(D^\times\times D^\times\times\mathrm{GL}_2, D\oplus D)$. We show their meromorphic continuation and functional equation, determine the location and orders of possible poles and compute the residue. Arguing along the theory of Saito and computing unramified local factors, the explicit formula of the zeta functions is obtained. Counting the order of possible poles of this explicit formula, we show that if $L(1/2, π)\neq0$, there are infinitely many quadratic extension $E$ of $F$ which embeds in $D$, such that $π$ has nonvanishing toric period with respect to $E$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miyu Suzuki, Satoshi Wakatsuki. 2024-06-04. Zeta functions and nonvanishing theorems for toric periods on $\mathrm{GL}_2$. https://arxiv.org/abs/2005.02017

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