Notes on Fibonacci Partitions

Abstract

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $Φ_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I deduce a formula for the function $Φ(n;t):=\sum_{h\geq 1}Φ_h(n)t^h$, and use it to analyze the functions $F(n):=Φ(n;1)$ and $χ(n):=Φ(n;-1)$. I obtain the least upper bound for $F(n)$ when $f_i-1\ 2$, I define a special finite set $\mathbb{G}(k)$ of solutions of the equation $F(n)=k$, all solutions can be easily obtained from $\mathbb{G}(k)$. This construction uses a representation of rational numbers as certain continued fractions and provides with a canonical identification $\coprod_{k\>2}\mathbb{G}(k)=\G_+$, where $\G_+$ is the monoid freely generated by the positive rational numbers $<1$. Let $Ψ(k)$ be the cardinality of $\mathbb{G}(k)$. I prove that, for $i\>2k$ and $k\>2$, the interval $[f_i-1,f_{i+1}-1]$ contains exactly $2Ψ(k)$ solutions of the equation $F(n)=k$ and offer a formula for the Dirichlet generating function of the sequence $Ψ(k)$. I formulate conjectures on the set of minimal solutions of the equations $F(n)=k$ as $k$ varies and pose some questions concerning such solutions.