Combinatorics / CONCEPT
Recovering First-Pattern Decorated Data
Every first-pattern avoider with a largest fixed point has the prescribed decorated form.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH7
DOCUMENT LINKS1
Alignment of block lengths
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
- Cigler's Even-Strip Expansionsstructural-affinity · Closed
- Counting the First Arrow-Pattern Avoidersstructural-affinity · Closed
- Counting the First Decorated Familystructural-affinity · Closed
- Counting the Fixed Gap Tuplesstructural-affinity · Closed
- Counting the Second Arrow-Pattern Avoidersstructural-affinity · Closed
- Counting Words by Their Fixed Pointsstructural-affinity · Closed
- Decorated Objects for the First Patternstructural-affinity · Closed
- Decorated Objects for the Second Patternstructural-affinity · Closed
- Finite Sums for the Arrow-Wilf Equivalencestructural-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
- Sign-Reversing Cancellation of Colored Gapsstructural-affinity · Closed
- The Arrow-Wilf Equivalencestructural-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