WeakAscent

Navigation page for Blueprint/D5/S3/Combinatorics/WeakAscent/ at upstream snapshot 7fa241fb6ddef3be23e1655eb45b60f2493d8c69.

Contents

• Decomposition at the First Record
• Endpoints of Pure Histories
• Finiteness of Pure Histories
• Grouped Renewal Series
• Finiteness of Full Histories
• Kernel Coefficient Recursions
• Appending to the First Avoidance Class
• Enumeration of Original Pieces
• Pure Histories and Original Pieces
• The Bivariate Pure-History Series
• Pure Stack Histories
• Renewal at the First Old Site
• The Second Avoidance Class
• Continuation Series for the Second Class
• Counting Words in the Second Class
• Active Letters in the First Class
• The Survivor Series Factorization
• Transitions of Active Marks
• Weighted Renewal Counts
• Active Values and Occurrence Marks
• Children of Weak Ascent Sequences
• Equinumerosity of the Weak Ascent Sequence Classes in Class 215
• Counting Weak Ascent Extensions
• Weak Ascent Sequences and Vincular Avoidance
• The Height of a Weak Ascent Sequence
• Inserting a New Maximum
• Children of Vincular-Avoiding Permutations
• Parents of Vincular-Avoiding Permutations
• Weak Ascent Sequences Avoiding Four Patterns
• Equinumerosity with Semi-Baxter Permutations
• Active Sites and Records
• States of 210-Avoiding Weak Ascent Sequences