Search arXivSearch

arXiv · 1112.1676

Dimensions of group schemes of automorphisms of truncated Barsotti--Tate groups

Abstract

Let $D$ be a $p$-divisible group over an algebraically closed field $k$ of characteristic $p>0$. Let $n_D$ be the smallest non-negative integer such that $D$ is determined by $D[p^{n_D}]$ within the class of $p$-divisible groups over $k$ of the same codimension $c$ and dimension $d$ as $D$. We study $n_D$, lifts of $D[p^m]$ to truncated Barsotti--Tate groups of level $m+1$ over $k$, and the numbers $γ_D(i):=\dim(\pmb{Aut}(D[p^i]))$. We show that $n_D\le cd$, $(γ_D(i+1)-γ_D(i))_{i\in\Bbb N}$ is a decreasing sequence in $\Bbb N$, for $cd>0$ we have $γ_D(1)<γ_D(2)<...<γ_D(n_D)$, and for $m\in\{1,...,n_D-1\}$ there exists an infinite set of truncated Barsotti--Tate groups of level $m+1$ which are pairwise non-isomorphic and lift $D[p^m]$. Different generalizations to $p$-divisible groups with a smooth integral group scheme in the crystalline context are also proved.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ofer Gabber, Adrian Vasiu. 2012-07-24. Dimensions of group schemes of automorphisms of truncated Barsotti--Tate groups. https://doi.org/10.1093/imrn%2Frns165

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