Search arXivSearch

arXiv · 1401.5447

Modules with many non-associates and norm form equations with many families of solutions

Abstract

For every number field $\mathbb{K}$, with $[\mathbb{K}:\mathbb{Q}] \geq 3$, we show that the number of non-associates of the same norm in a full module in $\mathbb{K}$ does not depend only on $\mathbb{K}$, but can also depend on the module itself. As a corollary, the same can be true for the number of families of solutions of degenerate norm form equations. So the uniform bound obtained by Schmidt for the number of solutions in the non-degenerate case does not always hold in the degenerate case. For three-variable norm forms not arising from full modules, we do obtain a Schmidt-type bound for the number of families of solutions that, together with the above result, completes this aspect of the study of three-variable norm forms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul Voutier. 2014-01-21. Modules with many non-associates and norm form equations with many families of solutions. https://doi.org/10.1016/j.jnt.2013.11.006

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