Combinatorics / CONCEPT
From Cycle Words to Permutations
A rooted cycle word determines a permutation through its cyclic successors.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH2
DOCUMENT LINKS1
Recovery of a rooted cycle word
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
- Cyclic Pattern Avoidancestructural-affinity · Closed
- Low-Arc Insertionstructural-affinity · Closed
- Pattern Constraints on Cycle Arcsstructural-affinity · Closed
- Pattern Occurrences in Padovan Wordsstructural-affinity · Closed
- Recovering a Cyclic Permutationstructural-affinity · Closed
- Rotations and Circular Subwordsstructural-affinity · Closed
- Structure of Admissible Cycle Wordsstructural-affinity · Closed
- Successors After Low-Arc Insertionstructural-affinity · Closed
- The Fundamental Bijection and Fixed Avoidersstructural-affinity · Closed
- Triples in Separated Blocksstructural-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