Combinatorics / CONCEPT
Decorated Objects for the First Pattern
Decorated data insert decreasing lower entries around an upper permutation skeleton, giving avoiders with a prescribed largest fixed point.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH5
DOCUMENT LINKS1
The output uses each value once
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 the First Decorated Familystructural-affinity · Closed
- Counting Words by Their Fixed Pointsstructural-affinity · Closed
- Decorated Objects for the Second Patternstructural-affinity · Closed
- Gap Vectors and Interleaved Wordsstructural-affinity · Closed
- Insertion and Singleton Cyclesstructural-affinity · Closed
- Inverting the Second Decorated Constructionstructural-affinity · Closed
- Partitions by Extremal Fixed Pointsstructural-affinity · Closed
- Recovering First-Pattern Decorated Datastructural-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