Search arXivSearch

arXiv · 2502.13468

Bruhat-Tits buildings and $p$-adic period domains

Abstract

Let $G$ be a connected reductive group over a $p$-adic local field $F$. Rémy-Thuillier-Werner constructed embeddings of the (reduced) Bruhat-Tits building $\mathcal{B}(G,F)$ into the Berkovich spaces associated to suitable flag varieties of $G$, generalizing the work of Berkovich in split case. They defined compactifications of $\mathcal{B}(G,F)$ by taking closure inside these Berkovich flag varieties. We show that, in the setting of a basic local Shimura datum, the Rémy-Thuillier-Werner embedding factors through the associated $p$-adic Hodge-Tate period domain. Moreover, we compare the boundaries of the Berkovich compactification of $\mathcal{B}(G,F)$ with non basic Newton strata. In the case of $\mathrm{GL}_n$ and the cocharacter $μ=(1^d, 0^{n-d})$ for an integer $d$ which is coprime to $n$, we further construct a continuous retraction map from the $p$-adic period domain to the building. This reveals new information on these $p$-adic period domains, which share many similarities with the Drinfeld spaces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xu Shen, Ruishen Zhao. 2025-02-19. Bruhat-Tits buildings and $p$-adic period domains. https://arxiv.org/abs/2502.13468

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