相关论文: The Geometry of some Fibonacci Identities in the H…
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…
The research aims to construct a new type of matrix called the Fibonacci-Hessenberg-Lorentz matrix by multiplying Fibonacci-Hessenberg matrices with Lorentz matrix multiplication. The study will start by examining the properties of…
One of the best known and oldest identities for the Fibonacci sequence $F_n$ is $F_{n+1}F_{n-1}-F_{n}^2=(-1)^n$ which was derived first by R. Simson in 1753 and it is now called as Simson or Cassini Identity. In this paper, we generalize…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
We establish new product identities involving the $q$-analogue of the Fibonacci numbers. We show that the identities lead to alternate expressions of generating functions for close-packed dimers on non-orientable surfaces.
A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…
In this paper, we give some properties of the Tribonacci and Tribonacci-Lucas quaternions and obtain some identities for them.
We define hyperbolic Heron triangles (hyperbolic triangles with "rational" side-lengths and area) and parametrize them in two ways as rational points of certain elliptic curves. We show that there are infinitely many hyperbolic Heron…
We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
The Young--Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the…
Two mathematical aspects of the centuries-old Japanese sashiko stitching form hitomezashi are discussed: the encoding of designs using words from a binary alphabet, and duality. Traditional hitomezashi designs are analysed using these two…
We extend Fibonacci numbers with arbitrary weights and generalize a dozen Fibonacci identities. As a special case, we propose an elliptic extension which extends the $q$-Fibonacci polynomials appearing in Schur's work. The proofs of most of…
Cosmological polytopes of graphs are a geometric tool in physics to study wavefunctions for cosmological models whose Feynman diagram is given by the graph. After their recent introduction by Arkani-Hamed, Benincasa and Postnikov the focus…
In this paper, firstly, by a determinant of deformed Pascal's triangle, namely the normalized Hessenberg matrix determinant, to count Dyck paths, we give another combinatorial proof of the theorems which are of Catalan numbers determinant…
The equation commonly known as Sury's identity is a deceptively simple summation formula that connects the Lucas numbers, Fibonacci numbers, and powers of two. Many authors have given extensions and generalizations over the years; in this…
In this paper, we introduce the h-analogue of Fibonacci numbers for non-commutative h-plane. For h h'= 1 and h = 0, these are just the usual Fibonacci numbers as it should be. We also derive a collection of identities for these numbers.…
We investigate paths in Bernoulli's triangles, and derive several relations linking the partial sums of binomial coefficients to the Fibonacci numbers.
Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…
The Hosoya polynomial of a graph $G$ was introduced by H. Hosoya in 1988 as a counting polynomial, which actually counts the number of distances of paths of different lengths in $G$. The most interesting application of the Hosoya polynomial…