Related papers: Improved Formula for the Multi-Section of the Line…
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
New bispectral orthogonal polynomials are obtained from an unconventional truncation of the Askey-Wilson polynomials. In the limit $q \to 1$, they reduce to the para-Racah polynomials which are orthogonal with respect to a quadratic…
We introduce a class of sequences, defined by means of partial Bell polynomials, that contains a basis for the space of linear recurrence sequences with constant coefficients as well as other well-known sequences like Catalan and Motzkin.…
We consider polynomials that are defined as Wronskians of certain sets of Hermite polynomials. Our main result is a recurrence relation for these polynomials in terms of those of one or two degrees smaller, which generalizes the well-known…
In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…
We prove a version of Szemeredi's regularity lemma for subsets of a typical random set in F_p^n. As an application, a result on the distribution of three-term arithmetic progressions in sparse sets is discussed.
Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…
In this paper we consider a semi-classical variation of the weight related to the little $q$-Laguerre polynomials and obtain a second order second degree discrete equation for the recurrence coefficients in the three-term recurrence…
The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…
The paper contains the derivation of a general set of recurrence formulas for the calculus of the SU(3) Clebsch-Gordan coefficients. The first six sections are introductory, presenting the notations and placing SU(3) in the framework of the…
We investigate generalizations of the Charlier polynomials on the lattice $\mathbb{N}$, on the shifted lattice $\mathbb{N}+1-\beta$ and on the bi-lattice $\mathbb{N}\cup (\mathbb{N}+1-\beta)$. We show that the coefficients of the three-term…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…
We present some necessary and/or sufficient conditions for the positivity problem of three-term recurrence sequences. As applications we show the positivity of diagonal Taylor coefficients of some rational functions in a unified approach.…
We initiate the study of a natural generalisation of the classical Bochner-Krall problem asking which linear ordinary differential operators possess sequences of eigenpolynomials satisfying linear recurrence relations of finite length; the…
We study generating functions for the number of permutations in $S_n$ subject to set of restrictions. One of the restrictions belongs to $S_3$, while the others to $S_k$. It turns out that in a large variety of cases the answer can be…
A general formula is presented for any order derivative of Chebyshev polynomials instead of the existing recursive relationship. Hence, the Chebyshev finite difference method is made applicable not only to second order problems but also to…
We find generalized Jack polynomials for the group $SU(3)$ and verify that their Selberg averages for several first levels are given by Nekrasov functions. To compute the averages we derive recurrence relations for the $sl_3$ Selberg…
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…