Semi-Baxter and strong-Baxter permutations

zbMath1384.05003MaRDI QIDQ1745110

Simone Rinaldi, Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer

Publication date: 20 April 2018

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2017/19%20Bouvel%20Guerrini%20Rechnitzer%20Rinaldi.html

zbMATH Keywords

generating functionsgenerating treespattern-avoiding permutationsBaxter numbers

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Non-D-finite excursions in the quarter plane
• Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
• Resurrecting the asymptotics of linear recurrences
• Generating functions for generating trees
• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• The On-Line Encyclopedia of Integer Sequences
• Enumeration schemes for permutations avoiding barred patterns
• Forest-like permutations
• Partially directed paths in a wedge
• ECO:a methodology for the enumeration of combinatorial objects

This page was built for publication: Semi-Baxter and strong-Baxter permutations