Weight preservation for Fibonacci recurrences

From papers

Let FmF_m be the set of periodic sequences from the Fibonacci recurrence or its parity transform with initial condition (a0,a1)(Z/mZ)2(a_0,a_1)\in(\mathbb Z/m\mathbb Z)^2, taken modulo mm. For a divisor dd of a composite modulus mm, define the weight of a period qq of length q\ell_q in FdF_d by

wd(q)=qd2.w_d(q)=\frac{\ell_q}{d^2}.

If qdFdq_d\in F_d extends to periods qm(1),,qm(k)Fmq_m^{(1)},\ldots,q_m^{(k)}\in F_m reducing to qdq_d modulo dd, Weight Preservation of Fibonacci Recurrences.

wd(qd)=i=1kwm(qm(i)).w_d(q_d)=\sum_{i=1}^k w_m(q_m^{(i)}).

Thus the total weight of every period is conjectured to be conserved under extension from dd to mm; the supplied text gives examples but no resolution status.

Progress summary

Open

A 2025 preprint supports the conjecture with examples, but no general proof or counterexample has been publicly established.

The conjecture asserts that the total normalized length of all periods above a given period is unchanged when the modulus is enlarged. It appears as Conjecture 17 in a preprint published in October 2025.

October 2025 computational evidence

The preprint checks extensions such as d=2d=2 to m=6m=6 and d=3d=3 to m=6m=6, finding that the combined weights agree with the original weights. It also reports hierarchical self-similarity from pkp^k to pk+1p^{k+1}, but presents these observations as evidence rather than a proof; no counterexample or verification report is reported.

Current status (as of August 2026): The conjecture remains open; computational examples support weight preservation, but no general proof or counterexample is recorded in the retrieved sources.

Sources
Sources & referencesView supporting material

Primary source

Marc T. Pudelko, “Modular Periodicity of Random Initialized Recurrences”, arXiv:2510.24882 (2026).

Solutions 1

Proof

The claim follows from an orbit-fiber counting identity, valid much more generally than the Fibonacci recurrence.

For ε{1,1}\varepsilon\in\{1,-1\}, let

Aε=(011ε).A_\varepsilon= \begin{pmatrix}0&1\\1&\varepsilon\end{pmatrix}.

The Fibonacci recurrence and its parity transform act on initial-condition pairs by

(aj,aj+1)(aj+1,aj+εaj+1)=Aε(aj,aj+1).(a_j,a_{j+1}) \longmapsto (a_{j+1},a_j+\varepsilon a_{j+1}) =A_\varepsilon(a_j,a_{j+1}).

Since detAε=1\det A_\varepsilon=-1, this is a permutation of

Xs=(Z/sZ)2X_s=(\mathbb Z/s\mathbb Z)^2

for every s1s\ge1. Its permutation orbits are precisely the periods modulo ss, and orbit cardinality equals period length.

For dmd\mid m, coordinatewise reduction

π:XmXd\pi:X_m\longrightarrow X_d

commutes with both recurrence actions:

πAε,m=Aε,dπ.\pi A_{\varepsilon,m}=A_{\varepsilon,d}\pi.

Every fiber has cardinality

π1(x)=(m/d)2.|\pi^{-1}(x)|=(m/d)^2.

Fix an orbit OXdO\subset X_d of length \ell. Its full inverse image is invariant under Aε,mA_{\varepsilon,m}, so it decomposes into disjoint orbits

π1(O)=O1Or.\pi^{-1}(O)=O_1\sqcup\cdots\sqcup O_r.

Each OiO_i maps onto OO, since its image is a nonempty invariant subset of a single transitive orbit. Thus the OiO_i are exactly all periods modulo mm reducing to the chosen period modulo dd.

Counting the inverse image yields

i=1rOi=π1(O)=(md)2.\sum_{i=1}^r|O_i| = |\pi^{-1}(O)| = \ell\left(\frac md\right)^2.

Dividing by m2m^2 gives precisely

i=1rwm(Oi)=i=1rOim2=d2=wd(O).\sum_{i=1}^r w_m(O_i) = \sum_{i=1}^r\frac{|O_i|}{m^2} = \frac{\ell}{d^2} = w_d(O).

More generally, if AA is any integral r×rr\times r matrix whose determinant is coprime to mm, then for every dmd\mid m and every orbit OO modulo dd,

O orbit modulo m\Omodd=OOmr=Odr.\sum_{\substack{O'\text{ orbit modulo }m\O'\bmod d=O}} \frac{|O'|}{m^r} = \frac{|O|}{d^r}.

Thus orbit-weight preservation holds for every invertible integral linear recurrence in every dimension.

0 endorsements
Shivam Patel ·