Search arXivSearch

arXiv · 2603.24504

Legendre compressions and an integrality conjecture for the Hörmander--Bernhardsson extremal function

Abstract

We prove Conjecture~2 of Bondarenko, Ortega-Cerdà, Radchenko, and Seip for the three-term recurrence attached to the Hörmander--Bernhardsson extremal function $φ$. More precisely, define \[ \widetilde u_{-1}=0,\qquad \widetilde u_0=1, \] and \[ \widetilde u_{n+1} = \frac{4n+2}{n+1}\bigl(n(n+1)-λ\bigr)\widetilde u_n + \frac{4n}{n+1}x\,\widetilde u_{n-1}. \] Then \[ \widetilde u_n(x,λ)\in\mathbb Z[x,λ] \qquad(n\ge0). \] The proof is a determinant comparison in the scaled Legendre basis. After sign reversal and central-binomial normalization, the recurrence becomes exactly the continuant recurrence of a finite tridiagonal compression. In particular, if $T_n(a,λ)$ denotes the $n$th BOCRS tridiagonal truncation, then \[ \widetilde u_{n+1}(a^2,λ)=\binom{2n+2}{n+1}\det T_n(a,λ). \] As consequences, we derive that \[ \left(\fracπ{4C}\right)^2 \quad\text{and}\quad -\frac{L_τ(1)}{2C} \] are not simultaneously rational, where \(C\) is the sharp point-evaluation constant for $PW^1$, $\pmτ_n$ are the nonzero zeros of $φ$, and $ L_τ(1)=\sum_{n\ge1}\frac{(-1)^n}{τ_n}.$ Finally, if we write $φ(z)=\sum_{n\ge0}c_n z^{2n},$ then \[ c_n\in C^n\,\mathbb Z[π^2,C,L_τ(1)] \qquad(n\ge0). \]

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Khai-Hoan Nguyen-Dang. 2026-03-25. Legendre compressions and an integrality conjecture for the Hörmander--Bernhardsson extremal function. https://arxiv.org/abs/2603.24504

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