Related papers: The Fibonacci partition triangles
In this study, we introduce the generalized Tribonacci hyperbolic spinors and properties of this new special numbers system by the generalized Tribonacci numbers, which are one of the most general form of the third-order recurrence…
We give a survey of some known and some new results about factors of different sorts of $q-$Fibonacci numbers.
The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…
We determine the order of magnitude of the variance of the Fibonacci partition function. The answer is different to the most naive guess. The proof involves a diophantine system and an inhomogeneous linear recurrence.
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
This paper derives sparse recurrence relations between orthogonal polynomials on a triangle and their partial derivatives, which are analogous to recurrence relations for Jacobi polynomials. We derive these recurrences in a systematic…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…
We present a parametric family of Riordan arrays which are obtained by multiplying any Riordan array with a generalized Pascal array. In particular, we focus on some interesting properties of one-parameter Catalan triangles. We obtain…
We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…
In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
The Fibonomial coefficients are well-known analogues of the classical binomial coefficients. In 2009, Sagan and Savage introduced a combinatorial interpretation for these coefficients, based on tiling a rectangular grid. More recently,…
We show the existence of a series of transforms that capture several structures that underlie higher-dimensional partitions. These transforms lead to a sequence of triangles whose entries are given combinatorial interpretations as the…
We give an overview about some elementary properties of Hoggatt matrices, which are generalizations of Pascal triangle, and study q-analogs and Fibonacci analogs and derive a common generalization.
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…
It is well-known that the coefficients in Faa di Bruno's chain rule for higher derivatives can be expressed via numeration of partitions. It turns out that this has a natural form as a formula for the vector case. To this formula two proofs…
A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…
This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…