Search arXivSearch

arXiv · 2501.05950

On the geometry of splitting models

Abstract

We consider Shimura varieties associated to a unitary group of signature $(n-s,s)$ where $n$ is even. For these varieties, by using the spin splitting models from Zachos-Zhao, we construct flat, Cohen-Macaulay, and normal $p$-adic integral models with reduced special fiber and with an explicit moduli-theoretic description over odd primes $p$ which ramify in the imaginary quadratic field with level subgroup at $p$ given by the stabilizer of a $π$-modular lattice in the hermitian space. We prove that the special fiber of the corresponding splitting model is stratified by an explicit poset with a combinatorial description, similar to Bijakowski-Hernandez, and we describe its irreducible components. Additionally, we prove the closure relations for this stratification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. Bijakowski, I. Zachos, Z. Zhao. 2025-01-10. On the geometry of splitting models. https://arxiv.org/abs/2501.05950

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