Fibonacci-like property of partition function

TL;DR

This paper explores a Fibonacci-like property of the partition function, demonstrating conditions under which the inequality becomes an equality and extending the results to partitions with more summands.

Contribution

It establishes a new Fibonacci-like equality condition for the partition function under specific restrictions and generalizes this to partitions with multiple summands.

Findings

Partition function satisfies a Fibonacci-like equality under certain restrictions.

The equality extends to partitions with more summands.

Provides a new perspective on the structure of partition functions.

Abstract

The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then the inequality becomes an equality. Furthermore, we extend this result to cases with a greater number of summands.