Combinatorics / CONCEPT
Counting Words by Their Fixed Points
Fixed-point subsets of one-line permutation words are counted by factorials and derangement numbers.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH3
DOCUMENT LINKS1
Count with prescribed fixed points
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
- Decorated Objects for the First Patternstructural-affinity · Closed
- Decorated Objects for the Second Patternstructural-affinity · Closed
- Fixed Points and the Two Avoidance Conditionsstructural-affinity · Closed
- Gap Vectors and Interleaved Wordsstructural-affinity · Closed
- Insertion and Singleton Cyclesstructural-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