[Paper Review] On Summand Minimality of Generalized Zeckendorf Decompositions

Katherine Cordwell, Max Hlavacek+4 more|arXiv (Cornell University)|Aug 31, 2016

semigroups and automata theory7 references3 citations

TL;DR

This paper establishes that generalized Zeckendorf decompositions (gzd) of a positive integer use the fewest summands among all representations using the same linear recurrence sequence if and only if the recurrence's signature is weakly decreasing (i.e., $c_1 \geq \cdots \geq c_t$). The authors develop a framework for transforming any representation into the gzd via a linear algorithm and prove minimality through structural analysis and polynomial irreducibility arguments.

ABSTRACT

Zeckendorf proved that every number can be uniquely represented as a sum of non-consecutive Fibonacci numbers. This has been extended in many ways, including to linear recurrences $H_n=c_1 H_{n-1} + \cdots + c_t H_{n-t}$ where the $c_i$ are non-negative integers and $c_1$, $c_t \ge 1$. Every number has a unique generalized Zeckendorf decomposition (gzd) -- a representation composed of blocks that are lexicographically less than $(c_1,\dots,c_t)$, which we call the signature. We prove that the gzd of a positive integer $m$ uses the fewest number of summands out of all representations for $m$ using the same recurrence sequence, for all $m$, if and only if the signature of the linear recurrence is weakly decreasing (i.e., $c_1 \ge \cdots \ge c_t$). Following the parallel with well-known base $d$ representations, we develop a framework for naturally moving between representations of the same number using a linear recurrence, which we then utilize to construct an algorithm to turn any representation of a number into the gzd. To prove sufficiency, we show that if the signature is weakly decreasing then our algorithm results in fewer summands. To prove necessity we proceed by divide and conquer, breaking the analysis into several cases. When $c_1 > 1$, we give an example of a non-gzd representation of a number and show that it has fewer summands than the gzd by performing the same above-mentioned algorithm. When $c_1 = 1$, we non-constructively prove the existence of a counterexample by utilizing the irreducibility of a certain family of polynomials together with growth rate arguments.

Motivation & Objective

• To determine the conditions under which generalized Zeckendorf decompositions minimize the number of summands across all representations using a given linear recurrence sequence.
• To develop a systematic framework for converting any representation of a number into its generalized Zeckendorf decomposition using recurrence-based transformations.
• To characterize the structural properties of recurrence sequences—specifically their signature—under which the gzd is summand-minimal.
• To resolve the necessity and sufficiency of the weakly decreasing signature condition for summand minimality through constructive and non-constructive methods.

Proposed method

• The authors define generalized Zeckendorf decompositions as representations using blocks lexicographically less than the recurrence's signature $(c_1, \dots, c_t)$, ensuring uniqueness.
• They introduce a transformation algorithm that converts any valid representation into the gzd by iteratively replacing blocks that exceed the signature lexicographically.
• For sufficiency, they prove that if the signature is weakly decreasing, the algorithm reduces the number of summands, thus ensuring minimality.
• For necessity, they use a divide-and-conquer strategy, analyzing cases based on whether $c_1 = 1$ or $c_1 > 1$.
• When $c_1 > 1$, they construct explicit counterexamples showing non-gzd representations with fewer summands than the gzd.
• When $c_1 = 1$, they use growth rate arguments and the irreducibility of a family of polynomials to non-constructively prove the existence of a counterexample with fewer summands.

Experimental results

Research questions

• RQ1 Under what conditions on the recurrence signature is the generalized Zeckendorf decomposition summand-minimal among all representations using the same sequence?
• RQ2 Can a systematic algorithm transform any representation of a number into its generalized Zeckendorf decomposition while preserving or reducing the number of summands?
• RQ3 Is the weakly decreasing signature condition both necessary and sufficient for summand minimality in generalized Zeckendorf decompositions?
• RQ4 What structural or algebraic properties of the recurrence sequence prevent the gzd from being summand-minimal?

Key findings

• The generalized Zeckendorf decomposition uses the fewest summands among all representations using the same recurrence sequence if and only if the recurrence signature is weakly decreasing.
• A constructive algorithm exists that transforms any representation into the gzd, and when the signature is weakly decreasing, this process reduces the number of summands.
• When $c_1 > 1$, explicit non-gzd representations with fewer summands than the gzd can be constructed, demonstrating the necessity of the weakly decreasing condition.
• When $c_1 = 1$, the existence of a counterexample with fewer summands than the gzd is proven non-constructively using irreducibility of a polynomial family and asymptotic growth rate analysis.
• The framework for transforming representations is based on lexicographic comparison with the recurrence signature, enabling systematic reduction to the gzd.