The Fibonacci partition triangles

DOI10.1016/J.AIM.2012.04.010MaRDI QIDQ436162zbMATH OpenOpenAlexFDO

Authors Philipp Fahr, Claus Michael Ringel

Publication date 30 July 2012

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1109.2849

zbMATH Keywords

3-regular treeadditive functions on translation quiversDelannoy pathsFibonacci modulesFibonacci numbersKronecker quiverleft hammockspartition formulasPascal trianglerepresentations of quiversvalued translation quivers

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Binomial coefficients; factorials; (q)-identities (11B65) Representations of quivers and partially ordered sets (16G20)

Abstract: In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree. Here we show that the basic information can be rearranged in two triangles. They are quite similar to the Pascal triangle of the binomial coefficients, but in contrast to the additivity rule for the Pascal triangle, we now deal with additivity along hooks, or, equivalently, with additive functions for valued translation quivers. As for the Pascal triangle, we see that the numbers in these Fibonacci partition triangles are given by evaluating polynomials. We show that the two triangles can be obtained from each other by looking at differences of numbers, it is sufficient to take differences along arrows and knight's moves.

Review text

Building on their earlier work on quivers (directed graphs), in particular, the representation theory of the 3-Kronecker quivers, the authors here explore partition formulas for the Fibonacci numbers. The resulting two triangles, one for the even-index and the other for the odd-index Fibonacci numbers, resemble the classical Pascal triangle except there is additional additivity along ``hooks. The numbers along inclined lines are obtained by evaluating polynomials. The resulting triangles of numbers appear at once familiar and strange. The valued translation quivers present are derived from group actions and the 3-regular tree. At the end a further investigation is proposed-exploring the relationship of Delannoy paths and elements of the Fibonacci modules.

Recommendations

• A partition formula for Fibonacci numbers
• Categorification of the Fibonacci numbers using representations of quivers
• A poset structure on quasifibonacci partitions
• On Fibonacci partitions
• scientific article; zbMATH DE number 3895078

Cites work

• A partition formula for Fibonacci numbers
• Categorification of the Fibonacci numbers using representations of quivers
• Fibonacci and Lucas numbers with applications. Volume I
• Hammocks
• scientific article; zbMATH DE number 5688299 (Why is no real title available?)
• scientific article; zbMATH DE number 3697331 (Why is no real title available?)
• scientific article; zbMATH DE number 862970 (Why is no real title available?)
• Infinite Gabriel-Roiter measures for the 3-Kronecker quiver.

Cited in

(8)

• A poset structure on quasifibonacci partitions
• Brauer configuration algebras and Kronecker modules to categorify integer sequences
• Zigzag partitions and Fibonacci sequence of odd indexes.
• Fixed points of order-preserving transformations
• A partition formula for Fibonacci numbers
• Categorification of the Fibonacci numbers using representations of quivers
• Homological ideals as integer specializations of some Brauer configuration algebras
• Billiard partitions, Fibonacci sequences, SIP classes, and quivers

This page was built for publication: The Fibonacci partition triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436162)