Combinatorics / CONCEPT
Recovering a Cyclic Permutation
The orbit word of a cyclic permutation recovers its one-line form.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH3
DOCUMENT LINKS1
Recover the one-line permutation
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
- From Cycle Words to Permutationsstructural-affinity · Closed
- Low-Arc Insertionstructural-affinity · Closed
- Padovan Enumeration of Cyclic Avoidersstructural-affinity · Closed
- Pattern Constraints on Cycle Arcsstructural-affinity · Closed
- Rooted Cycle-Word Classesstructural-affinity · Closed
- Rotations and Circular Subwordsstructural-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
- Triples in Separated Blocksstructural-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