A relationship between the ideals of $\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right]$ and the Fibonacci numbers
Jos\'e Manuel Rodr\'iguez Caballero

TL;DR
This paper uncovers a surprising connection between the number of ideals in a certain algebra over a finite field at a specific value and Fibonacci numbers, revealing new combinatorial relationships.
Contribution
It establishes a novel link between algebraic ideal counts at a special parameter and Fibonacci numbers, including explicit formulas and generating functions.
Findings
C_n(q) is polynomial in q for fixed n
At q = (3+√5)/2, C_n(q) relates to Fibonacci numbers
The coefficients λ_n are given by a specific generating function
Abstract
Let be the number of ideals of codimension of , where is the finite field with elements. Kassel and Reutenauer [KasselReutenauer2015A] proved that is a polynomial in for any fixed value of . For , this combinatorial interpretation of is lost. Nevertheless, an unexpected connexion with Fibonacci numbers appears. Let be the -th Fibonacci number (following the convention , ). Define the series We will prove that for each , where the integers are given by the following generating function $$ \prod_{m \geq 1} \left(1+F\left(…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Mathematical Identities · Advanced Combinatorial Mathematics
