Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.05036

Multiplicities and Plancherel formula for the space of nondegenerate Hermitian matrices

Raphaël Beuzart-Plessis
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper contains two results concerning the spectral decomposition, in a broad sense, of the space of nondegenerate Hermitian matrices over a local field of characteristic zero. The first is an explicit Plancherel decomposition of the associated $L^2$ space thus confirming a conjecture of Sakellaridis-Venkatesh in this particular case. The second is a formula for the multiplicities of generic representations in the $p$-adic case that extends previous work of Feigon-Lapid-Offen. Both results are stated in terms of Arthur-Clozel's quadratic local base-change and the proofs are based on local analogs of two relative trace formulas previously studied by Jacquet and Ye and known as (relative) Kuznetsov trace formulas.

Explore related subjects

math.NTmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raphaël Beuzart-Plessis. 2021-01-16. Multiplicities and Plancherel formula for the space of nondegenerate Hermitian matrices. https://arxiv.org/abs/2008.05036

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↗