Search arXiv⌕ Search

arXiv · 2603.19343

Quadratic Reduction and Classical Multiple-Index Fibonacci-Lucas Identities

Abstract

We place several classical identities in a common algebraic framework. Let $x$ be an element of a unital algebra over a commutative ring $R$ satisfying $$ x^2-tx+d1=0. $$ Then every positive power of $x$ admits the universal reduction $$ x^m=P_m(t,d)x-dP_{m-1}(t,d)1, $$ where the coefficient polynomials $P_m$ form the generic Lucas sequence and are equivalently Dickson polynomials of the second kind. By the Cayley--Hamilton theorem, this gives the corresponding standard formula for powers of $2\times2$ matrices, whose scalar coefficients depend only on the trace and determinant. Applying suitable $R$-linear functionals to powers of the Fibonacci matrix yields uniform derivations of multiple-index identities for Fibonacci, Lucas, and generalized Fibonacci sequences. In particular, we recover the expansion for $F_{nm}$ derived by Mc Laughlin, who attributes it to Johnson, and recently reproved by Vorobtsov. The purpose of this note is expository: to make explicit the common mechanism connecting quadratic reduction, Lucas--Dickson polynomials, and matrix methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Mantovanelli. 2026-07-21. Quadratic Reduction and Classical Multiple-Index Fibonacci-Lucas Identities. https://arxiv.org/abs/2603.19343

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗