Search arXivSearch

arXiv · 2406.18498

Two improvements in Birch's theorem on forms

Abstract

Let $K$ be a Birch field, that is, a field for which every diagonal form of odd degree in sufficiently many variables admits a non-zero solution; for example, $K$ could be the field of rational numbers. Let $f_1, \ldots, f_r$ be homogeneous forms of odd degree over $K$ in $n$ variables, and let $Z$ be the variety they cut out. Birch proved if $n$ is sufficiently large then $Z(K)$ contains a non-zero point. We prove two results which show that $Z(K)$ is actually quite large. First, the Zariski closure of $Z(K)$ has bounded codimension in $\mathbf{A}^n$. And second, if the $f_i$'s have sufficiently high strength then $Z(K)$ is in fact Zariski dense in $Z$. The proofs use recent results on strength, and our methods build on recent work of Bik, Draisma, and Snowden, which established similar improvements to Brauer's theorem on forms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amichai Lampert, Andrew Snowden. 2024-06-26. Two improvements in Birch's theorem on forms. https://arxiv.org/abs/2406.18498

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