Combinatorics / CONCEPT
Peak Deletion and Insertion
Deleting up-down pairs gives a bijection between words and insertion data and lowers the height bound of paths.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS1
Deletion and insertion are inverse
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
- A negative answer to the final question of Problem 7.2structural-affinity · Closed
- A Width Bound from the Level Datastructural-affinity · Closed
- Almost palindromicity of pre-merged Gaussian determinantsstructural-affinity · Closed
- Expansion of the Multiple Sum into Pathsstructural-affinity · Closed
- Finite Ordered Level Recurrencestructural-affinity · Closed
- Gaussian Enumeration of Rectanglesstructural-affinity · Closed
- Gaussian Level Transitionsstructural-affinity · Closed
- Gaussian Recurrences and Symmetrystructural-affinity · Closed
- Gluing Ordered Levelsstructural-affinity · Closed
- Half-density modes of the asymmetric K-exclusion processstructural-affinity · Closed
- Prescribed Ordered Level Numbersstructural-affinity · Closed
- Refined Path Polynomials and Deletionstructural-affinity · Closed
- The Finite Andrews-Gordon Companion Identitystructural-affinity · Closed
- The Finite Andrews-Gordon Companion Polynomialsstructural-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