Combinatorics / CONCEPT
The Fundamental Bijection and Fixed Avoiders
Standard cycle notation defines the fundamental bijection and its fixed-pattern generating functions.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH2
DOCUMENT LINKS1
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
- Cycles from Record Blocksstructural-affinity · Closed
- Cyclic Pattern Avoidancestructural-affinity · Closed
- From Cycle Words to Permutationsstructural-affinity · Closed
- Iterated Pattern Avoidance and Its Countsstructural-affinity · Closed
- Pattern Occurrences in Padovan Wordsstructural-affinity · Closed
- Record Bounds and the Inverse Bijectionstructural-affinity · Closed
- Rotations and Circular Subwordsstructural-affinity · Closed
- Uniqueness of the Padovan Subsequencestructural-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