Arith / CONCEPT
Chebyshev Representation of the Recurrence Polynomial
The plus-recurrence polynomial is represented by a complex-scaled Chebyshev polynomial of the second kind.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS1
Complex Chebyshev bridge
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
- Exact Complex Roots of the Odd Recurrence Polynomialstructural-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
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance