Double eigenvalues of cycles weighted by the Fibonacci word

Give the edges of the n-cycle the weights a and b in the order of the letters of the Fibonacci word. Foltz observed (OEIS A401899, weights 1 and 2) that the Laplacian has only 3Fk distinct eigenvalues when n = 4Fk. We prove this for all k ≥ 4 and all positive weights a ≠ b: the 4Fk-cycle has exactly Fk double eigenvalues, the spectrum of the Fk-cycle twisted by the phase i, and all other eigenvalues are simple. For weights 1 and 2 we show by a 2-adic argument that 1 is a double eigenvalue exactly when n ∈ {20, 33, 53, 106}. Exact computation for n ≤ 6000 finds no other double eigenvalues. The archive holds the LaTeX source, exact verification programs (python-flint), an independent recheck and a mutation suite (code under the MIT licence). No formal (Lean) verification.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24419101
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Double eigenvalues of cycles weighted by the Fibonacci word

Vamshi Jandhyala
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

Double eigenvalues of cycles weighted by the Fibonacci word

Vamshi Jandhyala
preprint en

Abstract

Give the edges of the n-cycle the weights a and b in the order of the letters of the Fibonacci word. Foltz observed (OEIS A401899, weights 1 and 2) that the Laplacian has only 3Fk distinct eigenvalues when n = 4Fk. We prove this for all k ≥ 4 and all positive weights a ≠ b: the 4Fk-cycle has exactly Fk double eigenvalues, the spectrum of the Fk-cycle twisted by the phase i, and all other eigenvalues are simple. For weights 1 and 2 we show by a 2-adic argument that 1 is a double eigenvalue exactly when n ∈ {20, 33, 53, 106}. Exact computation for n ≤ 6000 finds no other double eigenvalues. The archive holds the LaTeX source, exact verification programs (python-flint), an independent recheck and a mutation suite (code under the MIT licence). No formal (Lean) verification.

Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon