Search arXivSearch

arXiv · 1710.01864

$p$-adic families of automorphic forms in the $μ$-ordinary setting

Abstract

We develop a theory of $p$-adic automorphic forms on unitary groups that allows $p$-adic interpolation in families and holds for all primes $p$ that do not ramify in the reflex field $E$ of the associated unitary Shimura variety. If the ordinary locus is nonempty (a condition only met if $p$ splits completely in $E$), we recover Hida's theory of $p$-adic automorphic forms, which is defined over the ordinary locus. More generally, we work over the $μ$-ordinary locus, which is open and dense. By eliminating the splitting condition on $p$, our framework should allow many results employing Hida's theory to extend to infinitely many more primes. We also provide a construction of $p$-adic families of automorphic forms that uses differential operators constructed in the paper. Our approach is to adapt the methods of Hida and Katz to the more general $μ$-ordinary setting, while also building on papers of each author. Along the way, we encounter some unexpected challenges and subtleties that do not arise in the ordinary setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

E. Eischen, E. Mantovan. 2020-03-06. $p$-adic families of automorphic forms in the $μ$-ordinary setting. https://doi.org/10.1353/ajm.2021.0006

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