Search arXivSearch

arXiv · 1007.0332

Explicit Construction of Self-Dual Integral Normal Bases for the Square-Root of the Inverse Different

Abstract

Let $K$ be a finite extension of $\Q_p$, let $L/K$ be a finite abelian Galois extension of odd degree and let $\bo_L$ be the valuation ring of $L$. We define $A_{L/K}$ to be the unique fractional $\bo_L$-ideal with square equal to the inverse different of $L/K$. For $p$ an odd prime and $L/\Q_p$ contained in certain cyclotomic extensions, Erez has described integral normal bases for $A_{L/\Q_p}$ that are self-dual with respect to the trace form. Assuming $K/\Q_p$ to be unramified we generate odd abelian weakly ramified extensions of $K$ using Lubin-Tate formal groups. We then use Dwork's exponential power series to explicitly construct self-dual integral normal bases for the square-root of the inverse different in these extensions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erik Jarl Pickett. 2010-07-02. Explicit Construction of Self-Dual Integral Normal Bases for the Square-Root of the Inverse Different. https://doi.org/10.1016/j.jnt.2009.02.012

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