Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2205.00464

Quadrature formulas for Bessel polynomials

Hideki Matsumura
View original source ↗Read source document ↗Export metadata ↓

Abstract

A quadrature formula is a formula computing a definite integration by evaluation at finite points. The existence of certain quadrature formulas for orthogonal polynomials is related to interesting problems such as Waring's problem in number theory and spherical designs in algebraic combinatorics. Sawa and Uchida proved the existence and the non-existence of certain rational quadrature formulas for the weight functions of certain classical orthogonal polynomials. Classical orthogonal polynomials belong to the Askey-scheme, which is a hierarchy of hypergeometric orthogonal polynomials. Thus, it is natural to extend the work of Sawa and Uchida to other polynomials in the Askey-scheme. In this article, we extend the work of Sawa and Uchida to the weight function of the Bessel polynomials. In the proofs, we use the Riesz--Shohat theorem and Newton polygons. It is also of number theoretic interest that proofs of some results are reduced to determining the sets of rational points on elliptic curves.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hideki Matsumura. 2023-03-24. Quadrature formulas for Bessel polynomials. https://doi.org/10.1016/j.indag.2023.01.001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗