The generalized order-k Fibonacci–Pell sequence by matrix methods

In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, then we define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix methods. Further, we give the generating function and combinatorial representations of these numbers. Also we present an algorithm for computing the sums of the generalized order-k Pell numbers, as well as the Pell numbers themselves.     

Computation methods for combinatorial sums and Euler‐type numbers related to new families of numbers

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order. We can show that these numbers are related to the well‐known numbers and polynomials such as the Stirling numbers of the second kind and the central factorial numbers, the array polynomials, the rook numbers and polynomials, the Bernstein basis functions and others. In order to derive our new identities and relations for these numbers, we use a technique including the generating functions and functional equations. Finally, we give not only a computational algorithm for these numbers but also some numerical values of these numbers and the Euler numbers of negative order with tables. We also give some combinatorial interpretations of our new numbers. Copyright © 2016 John Wiley & Sons, Ltd.     

Combinatorial telescoping for an identity of Andrews on parity in partitions

Recently Andrews proposed a problem of finding a combinatorial proof of an identity on the q-little Jacobi polynomials. We give a classification of certain triples of partitions and find bijections based on this classification. By the method of combinatorial telescoping for identities on sums of positive terms, we establish a recurrence relation that leads to the identity of Andrews.     

On the Adjacency-Jacobsthal numbers

In this article, we define the adjacency-Jacobsthal sequence and then we obtain the combinatorial representations and the sums of adjacency-Jacobsthal numbers by the aid of generating function and generating matrix of the adjacency-Jacobsthal sequence. Also, we derive the determinantal and the permanental representations of adjacency-Jacobsthal numbers by using certain matrices which are obtained from generating matrix of adjacency-Jacobsthal numbers. Furthermore, using the roots of characteristic polynomial of the adjacency-Jacobsthal sequence, we produce the Binet formula for adjacency-Jacobsthal numbers. Finally, we give the relationships between adjacency-Jacobsthal numbers and Fibonacci, Pell, and Jacobsthal numbers.     

Degenerate Bernoulli polynomials, generalized factorial sums, and their applications

We prove a general symmetric identity involving the degenerate Bernoulli polynomials and sums of generalized falling factorials, which unifies several known identities for Bernoulli and degenerate Bernoulli numbers and polynomials. We use this identity to describe some combinatorial relations between these polynomials and generalized factorial sums. As further applications we derive several identities, recurrences, and congruences involving the Bernoulli numbers, degenerate Bernoulli numbers, generalized factorial sums, Stirling numbers of the first kind, Bernoulli numbers of higher order, and Bernoulli numbers of the second kind.     

On Two Sequences of Orthogonal Polynomials Related to Jordan Blocks

We study two infinite sequences of polynomials related to Jordan blocks that have various interesting properties. We show that they are orthogonal polynomials whose sequences of moments are Catalan numbers and we relate them explicitly to the Chebyshev polynomials. We also use them to compute the singular values of some Jordan blocks. Finally, we investigate some combinatorial properties of the inverse sequences of these polynomials; we show them to be intimately related to the convolutions of the Catalan sequence.     

Tiling Proofs of Recent Sum Identities Involving Pell Numbers

In a recent note, Santana and Diaz-Barrero proved a number of sum identities involving the well-known Pell numbers. Their proofs relied heavily on the Binet formula for the Pell numbers. Our goal in this note is to reconsider these identities from a purely combinatorial viewpoint. We provide bijective proofs for each of the results by interpreting the Pell numbers as enumerators of certain types of tilings. In turn, our proofs provide helpful insight for straightforward generalizations of a number of the identities. Received July 20, 2006     

Analysis of the Bernstein basis functions: an approach to combinatorial sums involving binomial coefficients and Catalan numbers

We give some alternative forms of the generating functions for the Bernstein basis functions. Using these forms,we derive a collection of functional equations for the generating functions. By applying these equations, we prove some identities for the Bernstein basis functions. Integrating these identities, we derive a variety of identities and formulas, some old and some new, for combinatorial sums involving binomial coefficients, Pascal's rule, Vandermonde's type of convolution, the Bernoulli polynomials, and the Catalan numbers. Copyright © 2014 John Wiley & Sons, Ltd.     

Enumeration via ballot numbers

Several interesting combinatorial coefficients such as the Catalan numbers and the Bell numbers can be described either via a 3-term recurrence or as sums of (weighted) ballot numbers. This paper gives some general results connecting 3-term recurrences with ballot sequences with several applications to the enumeration of various combinatorial instances.     

On the restricted Chebyshev–Boubaker polynomials

Using the language of Riordan arrays, we study a one-parameter family of orthogonal polynomials that we call the restricted Chebyshev–Boubaker polynomials. We characterize these polynomials in terms of the three term recurrences that they satisfy, and we study certain central sequences defined by their coefficient arrays. We give an integral representation for their moments, and we show that the Hankel transforms of these moments have a simple form. We show that the (sequence) Hankel transform of the row sums of the corresponding moment matrix is defined by a family of polynomials closely related to the Chebyshev polynomials of the second kind, and that these row sums are in fact the moments of another family of orthogonal polynomials.     

Hankel transforms of generalized Motzkin numbers

We study Hankel transform of the sequences (u,l,d),t, and the classical Motzkin numbers. Using the method based on orthogonal polynomials, we give closed‐form evaluations of the Hankel transform of the aforementioned sequences, sums of two consecutive, and shifted sequences. We also show that these sequences satisfy some interesting convolutional properties. Finally, we partially consider the Hankel transform evaluation of the sums of two consecutive shifted (u,l,d)‐Motzkin numbers. Copyright © 2017 John Wiley & Sons, Ltd.     

Sobolev orthogonal polynomials in computing of Hankel determinants

In this paper, we study closed form evaluation for some special Hankel determinants arising in combinatorial analysis, especially for the bidirectional number sequences. We show that such problems are directly connected with the theory of quasi-definite discrete Sobolev orthogonal polynomials. It opens a lot of procedural dilemmas which we will try to exceed. A few examples deal with Fibonacci numbers and power sequences will illustrate our considerations. We believe that our usage of Sobolev orthogonal polynomials in Hankel determinant computation is quite new.     

Some Linear Functionals Having Classical Orthogonal Polynomials as Moments

In this paper, we deal with some linear functionals on the vector space of polynomials whose moments are, in certain normalization, classical orthogonal polynomials (Hermite, Laguerre and Gegenbauer). We show that these linear functionals are semiclassical of class, at most, three. We give the coefficients in the three-term recurrence relations that the corresponding monic orthogonal polynomial sequences satisfy.     

Sums of products of Cauchy numbers

In this paper, we consider a kind of sums involving Cauchy numbers, which have not been studied in the literature. By means of the method of coefficients, we give some properties of the sums. We further derive some recurrence relations and establish a series of identities involving the sums, Stirling numbers, generalized Bernoulli numbers, generalized Euler numbers, Lah numbers, and harmonic numbers. In particular, we generalize some relations between two kinds of Cauchy numbers and some identities for Cauchy numbers and Stirling numbers.     

Combinatorial identities related to 2 × 2 submatrices of recursive matrices

Recursive matrices are ubiquitous in combinatorics, which have been extensively studied. We focus on the study of the sums of 2 × 2 minors of certain recursive matrices, the alternating sums of their 2 × 2 minors, and the sums of their 2 × 2 permanents. We obtain some combinatorial identities related to these sums, which generalized the work of Sun and Ma (2014) [23,24]. With the help of the computer algebra package HolonomicFunctions, we further get some new identities involving Narayana polynomials.     

The infinite sum of reciprocal Pell numbers

In this paper, we consider infinite sums derived from the reciprocals of the Pell numbers. Then applying the floor function to the reciprocals of this sums, we obtain a new and interesting identity involving the Pell numbers.     

Exponential sums with Dickson polynomials

We give new bounds of exponential sums with sequences of iterations of Dickson polynomials over prime finite fields. This result is motivated by possible applications to polynomial generators of pseudorandom numbers.     

The hopf algebra of linearly recursive sequences

We explain how the space of linearly recursive sequences over a field can be considered as a Hopf algebra. The algebra structure is that of divided-power sequences, so we concentrate on the perhaps lesser-known coalgebra (diagonalization) structure. Such a sequence satisfies a minimal recursive relation, whose solution space is the subcoalgebra generated by the sequence. We discuss possible bases for the solution space from the point of view of diagonalization. In particular, we give an algorithm for diagonalizing a sequence in terms of the basis of the coalgebra it generates formed by its images under the difference-operator shift. The computation involves inverting the Hankel matrix of the sequence. We stress the classical connection (say over the real or complex numbers) with formal power series and the theory of linear homogeneous ordinary differential equations. It is hoped that this exposition will encourage the use of Hopf algebraic ideas in the study of certain combinatorial areas of mathematics.     

Two Kinds of Numbers and Their Applications

C. Radoux （J. Comput. Appl. Math., 115 （2000） 471-477） obtained a computational formula of Hankel determinants on some classical combinatorial sequences such as Catalan numbers and polynomials, Bell polynomials, Hermite polynomials, Derangement polynomials etc. From a pair of matrices this paper introduces two kinds of numbers. Using the first kind of numbers we give a unified treatment of Hankel determinants on those sequences, i.e., to consider a general representation of Hankel matrices on the first kind of numbers. It is interesting that the Hankel determinant of the first kind of numbers has a close relation that of the second kind of numbers.