Fibonacci degree conjecture for Golombic and Levine polynomials
Fibonacci degree conjecture for Golombic and Levine polynomials
Let be a word in reduced form, and let and be the th terms of its Golombic and Levine sequences. For the Fibonacci numbers , fix with .
Fibonacci degree conjecture. Both polynomial expressions and have degree in and degree in .
This predicts Fibonacci-number degree growth for the polynomial expressions arising from the Golombic and Levine constructions. The source presents it as an observed pattern following the corresponding polynomiality results; its resolution is not given.
Progress summary
The conjecture remains unproved: its defining paper records the Fibonacci degree pattern but gives no proof or counterexample.
The conjecture predicts that the polynomial expressions from the Golombic and Levine constructions have Fibonacci-number degrees in each exponent and base variable. It appears as Conjecture 5.2 in the paper introducing these sequences.
Known results
- Theorems 3.11 and 3.15 establish that, for fixed , the Golombic and Levine quantities are integer-valued polynomials in the parameters .
2026 paper records the conjecture
The paper describes the Fibonacci-degree pattern as an observed phenomenon and formulates it as Conjecture 5.2. No proof, counterexample, verification, withdrawal, or competing resolution was found in the retrieved sources.
Current status (as of August 2026): Polynomiality is established, but the asserted Fibonacci degrees remain an open conjecture with no publicly recorded proof or counterexample.
Sources
Sources & referencesView supporting material
Primary source
Johan Claes and Roland Miyamoto, “Golombic and Levine sequences”, arXiv:2602.10992 (2026).
Solutions 1
Sign in to submit a solution.
We prove both degree formulas simultaneously. Let
and initially specialize every to a positive integer. For a positive word , define
Choose either or , and write
Fix , set , and put
Both deployment and reversed deployment have the same length and sum of entries, so
Since all entries of the preceding row are positive, its deployment contains every label . Reversal preserves these labels, and therefore
The upper bound is immediate. For the lower bound,
Consequently, both operators satisfy the universal inequalities
Write , with . Directly,
and
Fix all parameters except one at arbitrary positive integer values. If , the initial degrees are
because the quadratic coefficient in is . If , the initial degrees are
because its coefficient in is
Suppose . Applying (1) as gives
The two bounds coincide because
Hence , and induction yields
These conclusions hold for every positive-integer specialization of all remaining parameters. The source's Theorems 3.11 and 3.15 establish that is a polynomial in the full parameter list. Any coefficient of a higher power of would therefore be a polynomial in the remaining parameters that vanishes on the entire positive-integer lattice, hence vanishes identically. Conversely, each positive specialization already attains the degrees in (3). Thus these are the degrees of the full multivariate polynomials.
Finally,
Substituting into (3) proves
and
for every and every .