Recommendations
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton
- Restricted 123-avoiding Baxter permutations and the Padovan numbers
- Shuffle of parenthesis systems and Baxter permutations
Cites work
- Analytic combinatorics
- ECO:a methodology for the enumeration of combinatorial objects
- Enumeration schemes for permutations avoiding barred patterns
- Forest-like permutations
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generating functions for generating trees
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- Non-D-finite excursions in the quarter plane
- Partially directed paths in a wedge
- Refined enumeration of permutations sorted with two stacks and a D₈-symmetry
- Resurrecting the asymptotics of linear recurrences
- The On-Line Encyclopedia of Integer Sequences
Cited in
(5)- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- The permuton limit of strong-Baxter and semi-Baxter permutations is the skew Brownian permuton
- Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
- Baxter permutations
- Restricted 123-avoiding Baxter permutations and the Padovan numbers
This page was built for publication: Semi-Baxter and strong-Baxter permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1745110)