Combinatorics / CONCEPT
Insertion and Singleton Cycles
Canonical insertion makes a chosen new value a singleton cycle in the inverse Foata map.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
Insertion preserves the old 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
- Counting Words by Their Fixed Pointsstructural-affinity · Closed
- Decorated Objects for the First Patternstructural-affinity · Closed
- Fixed Points and the Two Avoidance Conditionsstructural-affinity · Closed
- Gap Vectors and Interleaved Wordsstructural-affinity · Closed
- Partitions by Extremal Fixed Pointsstructural-affinity · Closed
- Recovering First-Pattern Decorated Datastructural-affinity · Closed
- Splitting at the Largest Valuestructural-affinity · Closed
- Uniqueness of the First Decorated Descriptionstructural-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