Combinatorics / CONCEPT
The Finite Andrews-Gordon Companion Polynomials
Gaussian binomials with a primed boundary convention define the two polynomial sums in the finite Andrews-Gordon companion identity.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS1
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Ferrers Coordinates with Ambient Paddingstructural-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
- Half-density modes of the asymmetric K-exclusion processstructural-affinity · Closed
- Peak Deletion and Insertionstructural-affinity · Closed
- Realizing Unimodal Coefficient Permutationsstructural-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