Search arXivSearch

arXiv · 1906.12206

On the Hasse invariants of the Tate normal forms $E_5$ and $E_7$

Abstract

A formula is proved for the number of linear factors over $\mathbb{F}_l$ of the Hasse invariant of the Tate normal form $E_5(b)$ for a point of order $5$, as a polynomial in the parameter $b$, in terms of the class number of the imaginary quadratic field $K=\mathbb{Q}(\sqrt{-l})$, proving a conjecture of the author from 2005. A similar theorem is proved for quadratic factors with constant term $-1$, and a theorem is stated for the number of quartic factors of a specific form in terms of the class number of $\mathbb{Q}(\sqrt{-5l})$. These results are shown to imply a recent conjecture of Nakaya on the number of linear factors over $\mathbb{F}_l$ of the supersingular polynomial $ss_l^{(5*)}(X)$ corresponding to the Fricke group $Γ_0^*(5)$. The degrees and forms of the irreducible factors of the Hasse invariant of the Tate normal form $E_7$ for a point of order $7$ are determined, which is used to show that the polynomial $ss_l^{(N*)}(X)$ for the group $Γ_0^*(N)$ has roots in $\mathbb{F}_{l^2}$, for any prime $l \neq N$, when $N \in \{2,3,5,7\}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrick Morton. 2020-08-17. On the Hasse invariants of the Tate normal forms $E_5$ and $E_7$. https://doi.org/10.1016/j.jnt.2020.07.008

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