Search arXivSearch

arXiv · 2605.15452

Explicitly combing hedgehogs over fields of Stufe 4

Abstract

Let $K[x,y,z]=K[X,Y,Z]/(X^2+Y^2+Z^2-1)$ be the coordinate ring of the algebraic unit sphere over a field $K$. Umberto Zannier showed that there exists a matrix in $\operatorname{SL}_3(K[x,y,z])$ with first row $(x,y,z)$ for $K=\mathbb Q_p$, the field of $p$-adic numbers for an odd prime $p$, or more generally, if $-1$ is a sum of two squares in $K$. The case $K=\mathbb Q_2$ remained open and was subsequently posed and discussed by Zannier with numerous researchers, thereby bringing the problem to broader attention. In 2025, Alexey Ananyevskiy and Marc Levine showed that such a matrix exists if and only if $K$ has Stufe at most $4$, equivalently, if there exist $a,b,c,d\in K$ such that $a^2+b^2+c^2+d^2=-1$. Since $\mathbb Q_2$ has Stufe $4$, this settled Zannier's problem. Their proof is purely existential and does not provide an explicit matrix. In this note, we construct an explicit example in terms of $a,b,c,d$ and describe the computational techniques used to find it.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Müller. 2026-05-14. Explicitly combing hedgehogs over fields of Stufe 4. https://arxiv.org/abs/2605.15452

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