The Lucas p-matrix

In this note, we study the Fibonacci and Lucas p-numbers. We introduce the Lucas p-matrix and companion matrices for the sums of the Fibonacci and Lucas p-numbers to derive some interesting identities of the Fibonacci and Lucas p-numbers.     

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.     

On the Fibonacci and Lucas p-numbers, their sums, families of bipartite graphs and permanents of certain matrices

In this paper we consider certain generalizations of the well-known Fibonacci and Lucas numbers, the generalized Fibonacci and Lucas p-numbers. We give relationships between the generalized Fibonacci p-numbers, F_p(n), and their sums, , and the 1-factors of a class of bipartite graphs. Further we determine certain matrices whose permanents generate the Lucas p-numbers and their sums.     

New identities involving generalized Fibonacci and generalized Lucas numbers

This paper presents two new identities involving generalized Fibonacci and generalized Lucas numbers. One of these identities generalize the two well-known identities of Sury and Marques which are recently developed. Some other interesting identities involving the famous numbers of Fibonacci, Lucas, Pell and Pell-Lucas numbers are also deduced as special cases of the two derived identities. Performing some mathematical operations on the introduced identities yield some other new identities involving generalized Fibonacci and generalized Lucas numbers.     

Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials

In this article, we find elements of the Lucas polynomials by using two matrices. We extend the study to the n-step Lucas polynomials. Then the Lucas polynomials and their relationship are generalized in the paper. Furthermore, we give relationships between the Fibonacci polynomials and the Lucas polynomials.     

Cauchy, Ferrers-Jackson and Chebyshev polynomials and identities for the powers of elements of some conjugate recurrence sequences

In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x ²ⁿ + y ²ⁿ , n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the first kind are presented here.     

Pell graphs

In this paper, we introduce the Pell graphs, a new family of graphs similar to the Fibonacci cubes. They are defined on certain ternary strings (Pell strings) and turn out to be subgraphs of Fibonacci cubes of odd index. Moreover, as well as ordinary hypercubes and Fibonacci cubes, Pell graphs have several interesting structural and enumerative properties. Here, we determine some of them. Specifically, we obtain a canonical decomposition giving a recursive structure, some basic properties (bipartiteness and existence of maximal matchings), some metric properties (radius, diameter, center, periphery, medianicity), some properties on subhypercubes (cube coefficients and polynomials, cube indices, decomposition in subhypercubes), and, finally, the distribution of the degrees.     

Introduction to Fibonacci and Lucas hybrinomials

ABSTRACT

The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper, we introduce and study the Fibonacci and Lucas hybrinomials, i.e. polynomials, which are a generalization of the Fibonacci hybrid numbers and the Lucas hybrid numbers, respectively.     

Combinatorial numbers in binary recurrences

We give several effective and explicit results concerning the values of some polynomials in binary recurrence sequences. First we provide an effective finiteness theorem for certain combinatorial numbers (binomial coefficients, products of consecutive integers, power sums, alternating power sums) in binary recurrence sequences, under some assumptions. We also give an efficient algorithm (based on genus 1 curves) for determining the values of certain degree 4 polynomials in such sequences. Finally, partly by the help of this algorithm we completely determine all combinatorial numbers of the above type for the small values of the parameter involved in the Fibonacci, Lucas, Pell and associated Pell sequences.      

Linear recurrences associated to rays in Pascal’s triangle and combinatorial identities

Our main purpose is to describe the recurrence relation associated to the sum of diagonal elements laying along a finite ray crossing Pascal’s triangle. We precise the generating function of the sequence of described sums. We also answer a question of Horadam posed in his paper [Chebyshev and Pell connections, Fibonacci Quart. 43 (2005), 108–121]. Further, using Morgan-Voyce sequence, we establish the nice identity $F_{n + 1} - iF_n = i^n \sum\limits_{k = 0}^n {(_{2k}^{n + k} )( - 2 - i)^k } $ of Fibonacci numbers, where i is the imaginary unit. Finally, connections to continued fractions, bivariate polynomials and finite differences are given.     

Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints

We propose an efficient approach to the problem of multi-degree reduction of rectangular Bézier patches, with prescribed boundary control points. We observe that the solution can be given in terms of constrained bivariate dual Bernstein polynomials. The complexity of the method is O(mn₁n₂) with m ? min(m₁, m₂), where (n₁, n₂) and (m₁, m₂) is the degree of the input and output Bézier surface, respectively. If the approximation—with appropriate boundary constraints—is performed for each patch of several smoothly joined rectangular Bézier surfaces, the result is a composite surface of global C^r continuity with a prescribed r ? 0. In the detailed discussion, we restrict ourselves to r ∈ {0, 1}, which is the most important case in practical application. Some illustrative examples are given.     

The Lucas p-triangle

In this note, we study the Lucas p-numbers and introduce the Lucas p-triangle, which generalize the Lucas triangle is defined by Feinberg. We derive an expansion for the Lucas p-numbers by using some properties of our triangle.     

Tchebyshev triangulations of stable simplicial complexes

We generalize the notion of the Tchebyshev transform of a graded poset to a triangulation of an arbitrary simplicial complex in such a way that, at the level of the associated F-polynomials j_∑fj−1(j(x−1)/2), the triangulation induces taking the Tchebyshev transform of the first kind. We also present a related multiset of simplicial complexes whose association induces taking the Tchebyshev transform of the second kind. Using the reverse implication of a theorem by Schelin we observe that the Tchebyshev transforms of Schur stable polynomials with real coefficients have interlaced real roots in the interval (−1,1), and present ways to construct simplicial complexes with Schur stable F-polynomials. We show that the order complex of a Boolean algebra is Schur stable. Using and expanding the recently discovered relation between the derivative polynomials for tangent and secant and the Tchebyshev polynomials we prove that the roots of the corresponding pairs of derivative polynomials are all pure imaginary, of modulus at most one, and interlaced.     

Cube Polynomial of Fibonacci and Lucas Cubes

The cube polynomial of a graph is the counting polynomial for the number of induced k-dimensional hypercubes (k≥0). We determine the cube polynomial of Fibonacci cubes and Lucas cubes, as well as the generating functions for the sequences of these cubes. Several explicit formulas for the coefficients of these polynomials are obtained, in particular they can be expressed with convolved Fibonacci numbers. Zeros of the studied cube polynomials are explicitly determined. Consequently, the coefficients sequences of cube polynomials of Fibonacci and Lucas cubes are unimodal.     

Notes on generalization of the Bernoulli type polynomials

Recently, Srivastava et al. introduced a new generalization of the Bernoulli, Euler and Genocchi polynomials (see [H.M. Srivastava, M. Garg, S. Choudhary, Russian J. Math. Phys. 17 (2010) 251-261] and [H.M. Srivastava, M. Garg, S. Choudhary, Taiwanese J. Math. 15 (2011) 283-305]). They established several interesting properties of these general polynomials, the generalized Hurwitz-Lerch zeta functions and also in series involving the familiar Gaussian hypergeometric function. By the same motivation of Srivastava’s et al. [11] and [12], we introduce and derive multiplication formula and some identities related to the generalized Bernoulli type polynomials of higher order associated with positive real parameters a, b and c. We also establish multiple alternating sums in terms of these polynomials. Moreover, by differentiating the generating function of these polynomials, we give a interpolation function of these polynomials.     

On factorization of the Fibonacci and Lucas numbers using tridiagonal determinants

The aim of this paper is to give new results about factorizations of the Fibonacci numbers F _n and the Lucas numbers L _n . These numbers are defined by the second order recurrence relation a _n+2 = a _n+1+a _n with the initial terms F ₀ = 0, F ₁ = 1 and L ₀ = 2, L ₁ = 1, respectively. Proofs of theorems are done with the help of connections between determinants of tridiagonal matrices and the Fibonacci and the Lucas numbers using the Chebyshev polynomials. This method extends the approach used in [CAHILL, N. D.—D’ERRICO, J. R.—SPENCE, J. P.: Complex factorizations of the Fibonacci and Lucas numbers, Fibonacci Quart. 41 (2003), 13–19], and CAHILL, N. D.—NARAYAN, D. A.: Fibonacci and Lucas numbers as tridiagonal matrix determinants, Fibonacci Quart. 42 (2004), 216–221].     

关于两类广义多项式的一些恒等式(英文)

By means of generating function and partial derivative methods, we investigate and establish several general summation formulas involving two classes of polynomials. The general results would apply to yield some identities for the Pell polynomials and Pell-Lucas polynomials, and other general polynomials can also be recovered in this paper.     

New ideas for decomposing nonlinearities in differential equations

In this paper we consider the decomposition for the nonlinearity in a differential equation for the solution by decomposition. By analyzing and transforming the Taylor expansion of the nonlinearity about the initial solution component, the decomposition of the nonlinearity is converted to the partitions of the solution sets for a class of Diophantine equations. This conversion simplifies the discussion and presents a new idea for decompositions. We enumerate five types of partitions and their corresponding decomposition polynomials. Each of the last four types contains infinitely many kinds of decomposition polynomials in the form of finite sums. In Types 2, 3 and 4, there is a parameter q and each value of q corresponds to a class of decomposition polynomials. In Type 5, each positive integer sequence {c_j} satisfying 1 = c₁ ? c₂ ? ? and j ? c_j for j = 2, 3, … corresponds to a class of decomposition polynomials. Four classes of the Adomian polynomials [R. Rach, A new definition of the Adomian polynomials, Kybernetes 37 (2008) 910-955] are derived as particular cases.     

An efficient algorithm for the multivariable Adomian polynomials

In this article the sum of the series of multivariable Adomian polynomials is demonstrated to be identical to a rearrangement of the multivariable Taylor expansion of an analytic function of the decomposition series of solutions u₁, u₂, … , u_m about the initial solution components u_1,0, u_2,0, … , u_m,0; of course the multivariable Adomian polynomials were developed and are eminently practical for the solution of coupled nonlinear differential equations. The index matrices and their simplified forms of the multivariable Adomian polynomials are introduced. We obtain the recurrence relations for the simplified index matrices, which provide a convenient algorithm for rapid generation of the multivariable Adomian polynomials. Another alternative algorithm for term recurrence is established. In these algorithms recurrence processes do not require complicated operations such as parametrization, expanding and regrouping, derivatives, etc. as practiced in prior art. The MATHEMATICA program generating the Adomian polynomials based on the algorithm in this article is designed.     

Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations

In this paper, we state and prove a new formula expressing explicitly the derivatives of shifted Chebyshev polynomials of any degree and for any fractional-order in terms of shifted Chebyshev polynomials themselves. We develop also a direct solution technique for solving the linear multi-order fractional differential equations (FDEs) with constant coefficients using a spectral tau method. The spatial approximation with its fractional-order derivatives (described in the Caputo sense) are based on shifted Chebyshev polynomials T_L,n(x) with x ∈ (0, L), L > 0 and n is the polynomial degree. We presented a shifted Chebyshev collocation method with shifted Chebyshev–Gauss points used as collocation nodes for solving nonlinear multi-order fractional initial value problems. Several numerical examples are considered aiming to demonstrate the validity and applicability of the proposed techniques and to compare with the existing results.