Fibonacci self-reciprocal polynomials and Fibonacci permutation polynomials
Neranga Fernando, Mohammad Rashid

TL;DR
This paper classifies self-reciprocal Fibonacci polynomials over various rings and finite fields, and analyzes their permutation properties by computing moments, advancing understanding of their algebraic and permutation characteristics.
Contribution
It provides a complete classification of self-reciprocal Fibonacci polynomials over integers and certain finite fields, and offers conditions for their permutation behavior.
Findings
Complete classification over $\\mathbb{Z}$ and specific finite fields
Computed moments of Fibonacci polynomials over finite fields
Derived necessary conditions for permutation polynomials
Abstract
Let be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over and , where and . We also present some partial results when . We also compute the first and second moments of Fibonacci polynomials over finite fields, which give necessary conditions for Fibonacci polynomials to be permutation polynomials over finite fields.
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 Combinatorial Mathematics · semigroups and automata theory
