Search arXivSearch

arXiv · math/0611368

The Analytic Strong Multiplicity One Theorem for GL_{m}(A_{K})

Abstract

Let $π=\otimesπ_{v}$ and $π^{\prime}=\otimesπ_{v}^{\prime}$ be two irreducible, automorphic, cuspidal representations of $GL_{m}(\mathbb{A}_{K}) >.$ Using the logarithmic zero-free region of Rankin-Selberg $L$-function, Moreno established the analytic strong multiplicity one theorem if at least one of them is self-contragredient, i.e. $π$ and $π^{\prime}$ will be equal if they have finitely many same local components $π_{v},π_{v}^{\prime},$ for which the norm of places are bounded polynomially by the analytic conductor of these cuspidal representations. Without the assumption of the self-contragredient for $π,π^{\prime},$ Brumley generalized this theorem by a a different method, which can be seen as an invariant of Rankin-Selberg method. In this paper, influenced by Landau's smooth method of Perron formula, we improved the degree of Brumley's polynomial bound to be $4m+ε.$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yonghui Wang. 2006-11-15. The Analytic Strong Multiplicity One Theorem for GL_{m}(A_{K}). https://arxiv.org/abs/math/0611368

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