Combinatorics / CONCEPT
Refined Path Polynomials and Deletion
Counting paths by deleted peaks yields a primed Gaussian recurrence, including negative virtual lengths.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH5
DOCUMENT LINKS1
The primed Gaussian deletion recurrence
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
- Expansion of the Multiple Sum into Pathsstructural-affinity · Closed
- Gaussian Enumeration of Rectanglesstructural-affinity · Closed
- Gaussian Level Transitionsstructural-affinity · Closed
- Peak Deletion and Insertionstructural-affinity · Closed
- The Finite Andrews-Gordon Companion Identitystructural-affinity · Closed
- The Normalized Source l-Fiberstructural-affinity · Closed
- The Weighted Image Formulastructural-affinity · Closed
- Weighted Paths in a Bounded Stripstructural-affinity · Closed
- Weighted Peak-Insertion Sumsstructural-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