Search arXivSearch

arXiv · 2507.16138

The structure of the double discriminant

Abstract

For a polynomial $f(x) = \sum_{i=0}^n a_i x^i$, we study the double discriminant $DD_{n,k} = \operatorname{disc}_{a_k} \operatorname{disc}_x f(x)$. This object has been well studied in algebraic geometry, but has been brought to recent prominence in number theory by its key role in the proof of the Bhargava--van der Waerden theorem. We bridge the knowledge gap for this object by proving an explicit factorization: $DD_{n,k}$ is the product of a square, a cube, and possibly a linear monomial. Our proof is entirely algebraic. We also investigate other aspects of this factorization.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Theresa C. Anderson, Ufuoma V. Asarhasa, Adam Bertelli, Fabian Gundlach, Evan M. O'Dorney. 2025-11-24. The structure of the double discriminant. https://arxiv.org/abs/2507.16138

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