Combinatorics / CONCEPT
Kagey's Binary Null Polynomial Recurrence
Binary integer polynomials of each positive degree that vanish modulo three at every integer satisfy Kagey's order-eight counting recurrence. Coefficient words identify the count with a nine-state transfer column; an exact column identity propagates through every matrix power.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH6
DOCUMENT LINKS0
The recurrence holds
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A total primitive witness-length comparisonstructural-affinity · Closed
- An executed ordered pair constructorstructural-affinity · Closed
- Cigler's Signed Strip and Cycle Walk Identitiesstructural-affinity · Closed
- Counted stack-to-tape simulationstructural-affinity · Closed
- Decision continuations and exact word movementstructural-affinity · Closed
- Executed polynomial transducer compositionstructural-affinity · Closed
- Executed unary polynomial budgetsstructural-affinity · Closed
- Tape execution inside finite stacksstructural-affinity · Closed
- Transfer Matrices for Signed Strip Pathsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance