Search arXivSearch

arXiv · 2503.21151

Geometric designs and Hilbert-Kamke equations of degree five for classical orthogonal polynomials

Abstract

In this paper we elucidate the advantage of examining the connections between Hilbert-Kamke equations and geometric designs, or Chebyshev-type quadrature, for classical orthogonal polynomials. We first establish that if a $5$-design with $6$ rational points for a symmetric classical measure is parametrized by rational functions, then the corresponding measure should be the Chebyshev measure $(1-t^2)^{-1/2}dt/π$ on $(-1,1)$. Our proof is based on the collaboration of a certain polynomial identity and some advanced techniques on the computation of the genus of a certain irreducible curve. Next, we prove a necessary and sufficient condition for the existence of rational $5$-designs for the Chebyshev measure. Moreover, as one of our main theorems, we construct an infinite family of ideal solutions for the Prouhet-Tarry-Escott (PTE) problem by utilizing rational $5$-designs for the Chebyshev measure, and then establish that, up to affine equivalence over $\mathbb{Q}$, such ideal solutions are included in the famous parametric solutions found by Borwein (2002).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Teruyuki Mishima, Xiao-Nan Lu, Masanori Sawa, Yukihiro Uchida. 2026-04-02. Geometric designs and Hilbert-Kamke equations of degree five for classical orthogonal polynomials. https://doi.org/10.1007/s40993-026-00723-4

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