A poset structure on quasifibonacci partitions (Q1040848): Difference between revisions

Let us use a Fibonacci sequence in the form \(F_1 = 1, F_2 = 2, F_3 = 3, F_4 = 5, \dots\) For a given integer \(N \geq 2\), the sequence \(A_1, A_2, \dots\) of positive integers is called a \textit{quasifibonacci sequence} of level \(N\) if \[ A_{k+N} = A_{k+N-1} + \dots + A_{k} \text{ for all integer \(k\) and} \] \[ A_{k} > A_{k-1} + \dots + A_1 \text{ for all \(1 \leq k \leq N\)}. \] Graphs and poset structures are constructed on the set of the partitions of quasifibonacci numbers. Some properties of these graphs and posets are discussed. Let \[ H(x) = \prod_{k \geq 1} (1 - x^{F_k}) = 1 - x - x^2 + x^4 + x^7 - x^8 + x^{11} - x^{12} - x^{13} + x^{14} + \dots \] and let \(h_m\) be the coefficient of \(x^m\) in \(H(x)\). N. Robbins proved that \(h_m \in \{ -1, 0, 1 \}\). A generalization of this fact is formulated and proved.