A relationship between the ideals of Fq[x, y, x-1, y-1 ] and the Fibonacci numbers
Abstract
Let Cn(q) be the number of ideals of codimension n of Fq[x, y, x-1, y-1 ], where Fq is the finite field with q elements. Kassel and Reutenauer [KasselReutenauer2015A] proved that Cn(q) is a polynomial in q for any fixed value of n ≥ 1. For q = 3+52, this combinatorial interpretation of Cn(q) is lost. Nevertheless, an unexpected connexion with Fibonacci numbers appears. Let fn be the n-th Fibonacci number (following the convention f0 = 0, f1 = 1). Define the series F(t) = Σn ≥ 1 f2n\,tn. We will prove that for each n ≥ 1, Cn( 3+52) = λn \, (f2n 3+52 - f2n-2 ) , where the integers λn ≥ 0 are given by the following generating function Πm ≥ 1 (1+F( tm)) = 1 + Σn ≥ 1 λn\,tn.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.