Combinatorics / CONCEPT
Weak Ascent Sequences and Vincular Avoidance
Weak ascent sequences avoiding 210 and permutations avoiding 2-41-3 define two enumeration problems.
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
- Active Letters in the First Classstructural-affinity · Closed
- Appending to the First Avoidance Classstructural-affinity · Closed
- Children of Weak Ascent Sequencesstructural-affinity · Closed
- Occurrences of Length-Three Patternsstructural-affinity · Closed
- States of 210-Avoiding Weak Ascent Sequencesstructural-affinity · Closed
- The Height of a Weak Ascent Sequencestructural-affinity · Closed
- The Second Avoidance Classstructural-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