Search arXivSearch

arXiv · 1801.06388

A note on multivariable $(φ,Γ)$-modules

Abstract

Let $F/{\mathbb Q}_p$ be a finite field extension, let $k$ be a field of characteristic $p$. Fix a Lubin Tate group $Φ$ for $F$ and let $Γ\times\cdots\timesΓ$ with $Γ={\mathcal O}_F^{\times}$ act on $k[[t_1,\ldots,t_n]][\prod_it_i^{-1}]$ by letting $γ_i$ (in the $i$-th factor $Γ$) act on $t_i$ by insertion of $t_i$ into the power series attached to $γ_i$ by $Φ$. We show that $k[[t_1,\ldots,t_n]][\prod_it_i^{-1}]$ admits no non-trivial ideal stable under $Γ$, thereby generalizing a result of Zábrádi (who had treated the case where $Φ$ is the multiplicative group). We then discuss applications to $(φ,Γ)$-modules over $k[[t_1,\ldots,t_n]][\prod_it_i^{-1}]$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elmar Große-Klönne. 2018-12-13. A note on multivariable $(φ,Γ)$-modules. https://doi.org/10.1007/s40993-018-0144-8

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