Search arXivSearch

arXiv · 2009.09807

Uniformizer of the False Tate Curve Extension of $\mathbb{Q}_p$

Abstract

Let $p\geq 3$ be a prime number. In this article, we study the canonical expansion of the primitive $p^n$-th root of unity $ζ_{p^n}$ in $p$-adic Mal'cev-Neumann field $\mathbb{L}_p$ for $n\geq 1$. More precisely, we give the explicit formula for the first $\aleph_0$ terms of the expansion of $ζ_{p^n}$ and as an application, we use it to construct a uniformizer of $K_{2,m}=\mathbb{Q}_p\left(ζ_{p^2},p^{1/p^m}\right)$ with $m\geq 1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shanwen Wang, Yijun Yuan. 2021-06-02. Uniformizer of the False Tate Curve Extension of $\mathbb{Q}_p$. https://doi.org/10.1007/s11139-021-00473-0

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