On generalized Fibonacci and Lucas polynomials

Let h(x) be a polynomial with real coefficients. We introduce h(x)-Fibonacci polynomials that generalize both Catalan’s Fibonacci polynomials and Byrd’s Fibonacci polynomials and also the k-Fibonacci numbers, and we provide properties for these h(x)-Fibonacci polynomials. We also introduce h(x)-Lucas polynomials that generalize the Lucas polynomials and present properties of these polynomials. In the last section we introduce the matrix Q_h(x) that generalizes the Q-matrix whose powers generate the Fibonacci numbers.     

A curious q-analogue of Hermite polynomials

Two well-known q-Hermite polynomials are the continuous and discrete q-Hermite polynomials. In this paper we consider a new family of q-Hermite polynomials and prove several curious properties about these polynomials. One striking property is the connection with q-Fibonacci and q-Lucas polynomials. The latter relation yields a generalization of the Touchard-Riordan formula.     

Fast block diagonalization of k-tridiagonal matrices

In the present paper, we give a fast algorithm for block diagonalization of k-tridiagonal matrices. The block diagonalization provides us with some useful results: e.g., another derivation of a very recent result on generalized k-Fibonacci numbers in [M.E.A. El-Mikkawy, T. Sogabe, A new family of k-Fibonacci numbers, Appl. Math. Comput. 215 (2010) 4456-4461]; efficient (symbolic) algorithm for computing the matrix determinant.     

The <Emphasis Type="Italic">k</Emphasis>-Fibonacci matrix and the Pascal matrix

We define the k-Fibonacci matrix as an extension of the classical Fibonacci matrix and relationed with the k-Fibonacci numbers. Then we give two factorizations of the Pascal matrix involving the k-Fibonacci matrix and two new matrices, L and R. As a consequence we find some combinatorial formulas involving the k-Fibonacci numbers.     

A new family of k-Fibonacci numbers

In the present paper, we give a new family of k-Fibonacci numbers and establish some properties of the relation to the ordinary Fibonacci numbers. Furthermore, we describe the recurrence relations and the generating functions of the new family for k=2 and k=3, and presents a few identity formulas for the family and the ordinary Fibonacci numbers.     

Nearly (k, s)-Fibonacci functional equations in β-normed spaces

In this paper, we solve the (k, s)-Fibonacci functional equation $$f_{k,s}(x)=kf_{k,s}(x-1)+sf_{k,s}(x-2).$$ Moreover, we prove the Hyers–Ulam stability of the (k, s)-Fibonacci functional equation in β-normed spaces.     

Bivariate Gonarov polynomials and integer sequences

Univariate Gonarov polynomials arose from the Gonarov interpolation problem in numerical analysis.They provide a natural basis of polynomials for working with u-parking functions,which are integer sequences whose order statistics are bounded by a given sequence u.In this paper,we study multivariate Gonarov polynomials,which form a basis of solutions for multivariate Gonarov interpolation problem.We present algebraic and analytic properties of multivariate Gonarov polynomials and establish a combinatorial relation with integer sequences.Explicitly,we prove that multivariate Gonarov polynomials enumerate k-tuples of integers sequences whose order statistics are bounded by certain weights along lattice paths in Nk.It leads to a higher-dimensional generalization of parking functions,for which many enumerative results can be derived from the theory of multivariate Gonarov polynomials.     

On the exact Markov inequality for k-monotone polynomials in uniform and L 1-norms

We consider the classical extremal problem of estimating norms of higher order derivatives of algebraic polynomials when their norms are given. The corresponding extremal problem for general polynomials in uniform norm was solved by A. A. Markov, while Bernstein found the exact constant in the Markov inequality for monotone polynomials. In this note we give Markov-type inequalities for higher order derivatives in the general class of k-monotone polynomials. In particular, in case of first derivative we find the exact solution of this extremal problem in both uniform and L ₁-norms. This exact solution is given in terms of the largest zeros of certain Jacobi polynomials.     

The $${}$$-Fibonacci Quaternion Polynomials: Some Combinatorial Properties

In this paper we consider the \({h(x)}\)-Fibonacci quaternion polynomials and present some properties involving these polynomials, including the exponential and Poisson generating functions.     

On arrangements of roots for a real hyperbolic polynomial and its derivatives

In this paper we count the number ?_n^(0,k), k?n−1, of connected components in the space Δ_n^(0,k) of all real degree n polynomials which a) have all their roots real and simple; and b) have no common root with their kth derivatives. In this case, we show that the only restriction on the arrangement of the roots of such a polynomial together with the roots of its kth derivative comes from the standard Rolle's theorem. On the other hand, we pose the general question of counting all possible root arrangements for a polynomial p(x) together with all its nonvanishing derivatives under the assumption that the roots of p(x) are real. Already the first nontrivial case n=4 shows that the obvious restrictions coming from the standard Rolle's theorem are insufficient. We prove a generalized Rolle's theorem which gives an additional restriction on root arrangements for polynomials.     

On a new generalization of Fibonacci quaternions

In this paper, we present a new generalization of the Fibonacci quaternions that are emerged as a generalization of the best known quaternions in the literature, such as classical Fibonacci quaternions, Pell quaternions, k -Fibonacci quaternions. We give the generating function and the Binet formula for these quaternions. By using the Binet formula, we obtain some well-known results. Also, we correct some results in [3] and [4] which have been overlooked that the quaternion multiplication is non commutative.     

<Emphasis Type="Italic">q</Emphasis>-Fibonacci Polynomials and the Rogers-Ramanujan Identities

We derive some formulas for the Carlitz q-Fibonacci polynomials F_n(t) which reduce to the finite version of the Rogers-Ramanujan identities obtained by I. Schur for t = 1. Our starting point is a representation of the q-Fibonacci polynomials as the weight of certain lattice paths in contained in a strip along the x-axis. We give an elementary combinatorial proof by using only the principle of inclusion-exclusion and some standard facts from q-analysis.     

Chain sequences and symmetric generalized orthogonal polynomials

In this paper, we derive an explicit expression for the parameter sequences of a chain sequence in terms of the corresponding orthogonal polynomials and their associated polynomials. We use this to study the orthogonal polynomials K_n^(λ,M,k) associated with the probability measure dφ(λ,M,k;x), which is the Gegenbauer measure of parameter λ+1 with two additional mass points at ±k. When k=1 we obtain information on the polynomials K_n^(λ,M) which are the symmetric Koornwinder polynomials. Monotonicity properties of the zeros of K_n^(λ,M,k) in relation to M and k are also given.     

Fueter polynomials in discrete Clifford analysis

Discrete Clifford analysis is a higher dimensional discrete function theory, based on skew Weyl relations. The basic notions are discrete monogenic functions, i.e. Clifford algebra valued functions in the kernel of a discrete Dirac operator. In this paper, we introduce the discrete Fueter polynomials, which form a basis of the space of discrete spherical monogenics, i.e. discrete monogenic, homogeneous polynomials. Their definition is based on a Cauchy–Kovalevskaya extension principle. We present the explicit construction for this discrete Fueter basis, in arbitrary dimension m and for arbitrary homogeneity degree k.     

Two new triangles of q-integers via q-Eulerian polynomials of type A and B

The classical Eulerian polynomials can be expanded in the basis t ^k?1(1+t) ^n+1?2k (1≤k≤?(n+1)/2?) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian polynomials. In this paper, we prove a q-analogue of this expansion for Carlitz’s q-Eulerian polynomials as well as a similar formula for Chow–Gessel’s q-Eulerian polynomials of type B. We shall give some applications of these two formulas, which involve two new sequences of polynomials in the variable q with positive integral coefficients. It is an open problem to give a combinatorial interpretation for these polynomials.     

General Expa-function method for nonlinear evolution equations

This work generalizes the exponential function method in considering an arbitrary base “a” as opposed to the conventional base “e” for the exponential function. The combined KdV-mKdV equation is considered to reveal the effectiveness and convenience of the proposed generalization. The study highlights the power of the proposed method on constructing solutions expressed in terms of exponential, hyperbolic, periodic, symmetrical Fibonacci, symmetrical Lucas, and k-Fibonacci functions. Some of the obtained solitary wave solutions are sketched graphically.     

Bivariate Fibonacci polynomials of order <Emphasis Type="Italic">k</Emphasis> with statistical applications

In the present article, we investigate the properties of bivariate Fibonacci polynomials of order k in terms of the generating functions. For k and ℓ (1 ≤ ℓ ≤ k − 1), the relationship between the bivariate Fibonacci polynomials of order k and the bivariate Fibonacci polynomials of order ℓ is elucidated. Lucas polynomials of order k are considered. We also reveal the relationship between Lucas polynomials of order k and Lucas polynomials of order ℓ. The present work extends several properties of Fibonacci and Lucas polynomials of order k, which will lead us a new type of geneses of these polynomials. We point out that Fibonacci and Lucas polynomials of order k are closely related to distributions of order k and show that the distributions possess properties analogous to the bivariate Fibonacci and Lucas polynomials of order k.     

Bipartitional polynomials and their applications in combinatorics and statistics

Bipartitional polynomials are multivariable polynomials Y_mn=Y_mn(cy₀₁,cy₁₀,cy₁₁,…,cy_mn), c^k≡c_k, defined by a sum over all partitions of the bipartite number (mn). Recurrence relations, generating functions and some basic properties of these polynomials are given. Applications in Combinatorics and Statistics are briefly indicated.     

Computation of the canonical polynomials and applications to some optimal control problems

The Tau method is a numerical technique that consists in constructing polynomial approximate solutions for ordinary differential equations. This method has two approaches: operational and recursive. The former converts the differential problem to a matrix problem and produces approximations in terms of a prescribed orthogonal polynomials basis. In the recursive approach, we construct approximate solutions in terms of a special set of polynomials {Q _k (t); k?=?0, 1, 2...} called canonical polynomials basis. In some cases, the Q _k ??s can be obtained explicitly through a recursive formula. But no analogous formulae are reported in the literature for the general cases. In this paper, utilizing the operational Tau method, we develop an algorithm that allows to generate those canonical polynomials iteratively and explicitly. In addition, we demonstrate the capability of the operational Tau method in treating quadratic optimal control problems governed by ordinary differential equations.     

On the complexity of generalized polynomials of <Emphasis Type="Italic">k</Emphasis>-valued functions

Specification of k-valued functions with generalized polynomials (for simple k) is considered. A generalized polynomial is a mod k polynomial in which each variable may also occur with one or several Post negations. The upper and lower estimates of the complexity of generalized polynomials are found for k-valued functions.