Factorization of spread polynomials
Johann Cigler, Hans-Christian Herbig

TL;DR
This paper proves a conjecture about the factorization of spread polynomials, showing how to compute their factors and linking them to Fibonacci number factorizations.
Contribution
It provides a proof of Goh and Wildberger's conjecture and introduces methods to calculate spread polynomial factors, connecting them to Fibonacci number factorizations.
Findings
Proof of the conjecture on spread polynomial factorization
Method for effective calculation of factors
Connection to Fibonacci number primitive factorizations
Abstract
We present a proof of a conjecture of Goh and Wildberger on the factorization of the spread polynomials. We indicate how the factors can be effectively calculated and exhibit a connection to the factorization of Fibonacci numbers into primitive parts.
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
Topicsgraph theory and CDMA systems · Polynomial and algebraic computation · Coding theory and cryptography
