相关论文: The Geometry of some Fibonacci Identities in the H…
We show how the Fibonacci's identity is used to obtain Euler bricks. Also,we put forward the relation between Fibonacci's identity and Euler's formula, which provides the description of Euler's bricks with noninteger spatial diagonal.…
We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…
We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…
Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping,…
The number of ways to tile an $n$-board (an $n\times1$ rectangular board) with $(\frac12,\frac12;1)$-, $(\frac12,\frac12;2)$-, and $(\frac12,\frac12;3)$-combs is $T_{n+2}^2$ where $T_n$ is the $n$th tribonacci number. A…
This book is addressed to students, professors and researchers of geometry, who will find herein many interesting and original results. The originality of the book The Geometry of Homological Triangles consists in using the homology of…
We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyper-Wiener index. An expression is obtained that reduces the computation of the Hosoya polynomials…
We have found some patterns in some triangles.
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
In this paper, we evaluate determinants of some families of Toeplitz-Hessenberg matrices having tribonacci number entries. These determinant formulas may also be expressed equivalently as identities that involve sums of products of…
In this study, we define a new type of Fibonacci and Lucas num- bers which are called bicomplex Fibonacci and bicomplex Lucas numbers. We obtain the well-known properties e.g. Docagnes, Cassini, Catalan for these new types. We also give the…
Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs has been studied extensively and generalized in many…
We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…
The link between the equation $b(b+a)-a^2=0$ concerning the side $b$ and the diagonal $a$ of a regular pentagon and the {\it Cassini identity} $F_{i}F_{i+2}-F_{i+1}^2=(-1)^{i}$, concerning three consecutive Fibonacci numbers, is very…
For each positive integer $n$, the Fibonacci-sum graph $G_n$ on vertices $1,2,\ldots,n$ is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each $G_n$ is bipartite, and all Hamiltonian…
We use probability urn models to discover some known and unknown series identities involving Fibonacci numbers.