Combinatorics / CONCEPT
The Height of a Weak Ascent Sequence
The weak ascent count bounds every entry of a weak ascent sequence.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH1
DOCUMENT LINKS1
The maximum lies below the height
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
- Active Letters in the First Classstructural-affinity · Closed
- Active Sites and Recordsstructural-affinity · Closed
- Appending to the First Avoidance Classstructural-affinity · Closed
- Children of Vincular-Avoiding Permutationsstructural-affinity · Closed
- Children of Weak Ascent Sequencesstructural-affinity · Closed
- Counting Weak Ascent Extensionsstructural-affinity · Closed
- Inserting a New Maximumstructural-affinity · Closed
- Parents of Vincular-Avoiding Permutationsstructural-affinity · Closed
- States of 210-Avoiding Weak Ascent Sequencesstructural-affinity · Closed
- The Second Avoidance Classstructural-affinity · Closed
- Weak Ascent Sequences and Vincular Avoidancestructural-affinity · Closed
- Weak Ascent Sequences Avoiding Four Patternsstructural-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