Combinatorics / CONCEPT
Partitions by Extremal Fixed Points
Avoiding words partition according to whether a fixed point exists and, if so, its largest or smallest value.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH4
DOCUMENT LINKS1
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 Arrow-Pattern Avoidersstructural-affinity · Closed
- Counting the First Decorated Familystructural-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
- 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