Search arXivSearch

arXiv · 1111.2483

Computing isomorphism numbers of F-crystals by using level torsions

Abstract

The isomorphism number of an $F$-crystal $(M, ϕ)$ over an algebraically closed field of positive characteristic is the smallest non-negative integer $n_M$ such that the $n_M$-th level truncation of $(M, ϕ)$ determines the isomorphism class of $(M, ϕ)$. When $(M, ϕ)$ is isoclinic, namely it has a unique Newton slopes $λ$, we provide an efficiently computable upper bound of $n_M$ in terms of the Hodge slopes of $(M, ϕ)$ and $λ$. This is achieved by providing an upper bound of the level torsion of $(M, ϕ)$ introduced by Vasiu. We also check that this upper bound is optimal for many families of isoclinic $F$-crystals that are of special interests (such as isoclinic $F$-crystals of K3 type).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiao Xiao. 2012-08-07. Computing isomorphism numbers of F-crystals by using level torsions. https://doi.org/10.1016/j.jnt.2012.05.035

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