Arith / CONCEPT
Exact Complex Roots of the Odd Recurrence Polynomial
The complex root multiset of every odd-index plus-recurrence polynomial is given by a simple cosine formula.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
Odd recurrence root multiset
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A Dyadic Analytic Integer Obstructionstructural-affinity · Closed
- An Explicit Lucas Growth Thresholdstructural-affinity · Closed
- Chebyshev Representation of the Recurrence Polynomialstructural-affinity · Closed
- Dyadic Fibonacci Quotients from k = 1structural-affinity · Closed
- Fibonacci Recurrence Polynomial Coefficientsstructural-affinity · Closed
- Fibonacci Recurrence Polynomial Third Coefficientstructural-affinity · Closed
- Nonsquares in Higher Odd Prime-Power Layersstructural-affinity · Closed
- Odd-Index Fibonacci Recurrence Bridgestructural-affinity · Closed
- Opposite-Root Symmetry at Odd Orderstructural-affinity · Closed
- Prime-Power Fibonacci Quotients in Twenty-Eight Residue Classesstructural-affinity · Closed
- Prime-Power Fibonacci Quotients in Two Further Residue Classesstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance