Related papers: Fibonacci numbers and orthogonal polynomials
The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…
In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…
A result of P\'olya states that every sequence of quadrature formulas $Q_n(f)$ with $n$ nodes and positive numbers converges to the integral $I(f)$ of a continuous function $f$ provided $Q_n(f)=I(f)$ for a space of algebraic polynomials of…
Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…
We characterize the atomic probability measure on $\mathbb{R}^d$ which having a finite number of atoms. We further prove that the Jacobi sequences associated to the multiple Hermite (resp. Laguerre, resp. Jacobi) orthogonal polynomials are…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…
The aim of this paper is to study differential properties of orthogonal polynomials with respect to a discrete Jacobi-Sobolev bilinear form with mass point at $-1$ and/or $+1$. In particular, we construct the orthogonal polynomials using…
A number $s$ is the sum of the entries of the inverse of an $n \times n, (n \geq 3)$ upper triangular matrix with entries from the set $\{0, 1\}$ if and only if $s$ is an integer lying between $2-F_{n-1}$ and $2+F_{n-1}$, where $F_n$ is the…
We present a novel numerical method, called {\tt Jacobi-predictor-corrector approach}, for the numerical solution of fractional ordinary differential equations based on the polynomial interpolation and the Gauss-Lobatto quadrature w.r.t.…
We calculate the Hankel determinants of sequences of Bernoulli polynomials. This corresponding Hankel matrix comes from statistically estimating the variance in nonparametric regression. Besides its entries' natural and deep connection with…
We consider some discrete $q$-analogues of the classical continuous orthogonal polynomial ensembles. Building on results due to Morozov, Popolitov and Shakirov, we find representations for the moments of the discrete $q$-Hermite and…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
In this paper we study a generalization of the class of orthogonal polynomials on the real line. These polynomials satisfy the following relation: $(J_5 - \lambda J_3) \vec p(\lambda) = 0$, where $J_3$ is a Jacobi matrix and $J_5$ is a…
If a sequence indexed by nonnegative integers satisfies a linear recurrence without constant terms, one can extend the indices of the sequence to negative integers using the recurrence. Recently, Cigler and Krattenthaler showed that the…
We show that Genocchi and Bernoulli numbers are closely related to Fibonacci polynomials and derive some q-analogues.
Given $\{P_n \}$ a sequence of monic orthogonal polynomials, we analyze their linear combinations $\{Q_n \}$with constant coefficients and fixed length $k+1$. Necessary and sufficient conditions are given for the orthogonality of the monic…
About four centuries ago, Johann Faulhaber developed formulas for the power sum $1^n + 2^n + \cdots + m^n$ in terms of $m(m+1)/2$. The resulting polynomials are called the Faulhaber polynomials. We first give a short survey of Faulhaber's…
We consider generalized closest return times of a complex polynomial of degree at least two. Most previous studies on this subject have focused on the properties of polynomials with particular return times, especially the Fibonacci numbers.…
We study a family of orthogonal polynomials which satisfy (apart from a 3-term recurrence relation) an eigenvalue equation involving a third order differential operator of Dunkl-type. The orthogonality measure of these polynomials consists…