Search arXivSearch

arXiv · 2605.29342

Inducing Whittaker Functions from Higher Ranks

Abstract

We construct a family of Whittaker functions for $SL(m,\mathbb{Z})$ induced directly from Whittaker functions for $SL(n,\mathbb{Z})$, for any $2 \leq m<n$. Given Jacquet's Whittaker function $W_{α,N}^{(n)}$ on the generalized upper half-plane $\mathfrak{h}^n$, we show that the function $V_{α,N}^{(m)}:\mathfrak{h}^m\to\mathbb{C}$ defined by restricting $W_{α,N}^{(n)}$ to the block-diagonal embedding $\mathfrak{h}^m\hookrightarrow\mathfrak{h}^n$ is a Whittaker function for $SL(m,\mathbb{Z})$, provided the Langlands parameters $α=(α_i)_{1\leq i\leq n}$ satisfy $\sum_{i=1}^mα_i = m(m-n)/2$. Under this condition, the induced function carries Langlands parameters $\bigl(α_i+\frac{n-m}{2}\bigr)_{1\leq i\leq m}$ and inherits the first $m-1$ entries of the character tuple of $W_{α,N}^{(n)}$. This result complements the propagation formulas of Ishii and Stade, which relate Whittaker functions on $GL(n,\mathbb{R})$ to those on $GL(n-1,\mathbb{R})$ and $GL(n-2,\mathbb{R})$. In contrast, our construction passes directly from $GL(n,\mathbb{R})$ to $GL(m,\mathbb{R})$ for any $m < n$ in a single step.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vishal Muthuvel. 2026-05-28. Inducing Whittaker Functions from Higher Ranks. https://arxiv.org/abs/2605.29342

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