Combinatorics / CONCEPT
Four-Branch Decomposition
The admissible rooted cycle words decompose into four insertion branches.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH6
DOCUMENT LINKS1
Insertion decomposition
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
- Decomposing Padovan Cycle Wordsstructural-affinity · Closed
- Insertion Branches for Padovan Wordsstructural-affinity · Closed
- One-Line Avoidance Under Insertionstructural-affinity · Closed
- Padovan Counting Recurrencestructural-affinity · Closed
- Padovan Enumeration of Cyclic Avoidersstructural-affinity · Closed
- Rooted Cycle-Word Classesstructural-affinity · Closed
- Structure of Admissible Cycle Wordsstructural-affinity · Closed
- Successors After Low-Arc Insertionstructural-affinity · Closed
- Successors of Padovan Cycle Wordsstructural-affinity · Closed
- Tetranacci Enumeration of Cyclic Avoidersstructural-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