Five classes of pattern avoiding inversion sequences under one roof: generating trees

DOI10.1080/10236198.2023.2253327OpenAlexW4386279787MaRDI QIDQ6081493

Toufik Mansour

Publication date: 5 October 2023

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10236198.2023.2253327

zbMATH Keywords

kernel methodgenerating treespattern avoidanceinversion sequences

Mathematics Subject Classification ID

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

Cites Work

• Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
• Length-four pattern avoidance in inversion sequences
• Vincular patterns in inversion sequences
• Kernel method and linear recurrence system
• Wilf equivalences between vincular patterns in inversion sequences
• Patterns in Inversion Sequences I
• Pattern avoidance in inversion sequences
• Inversion sequences avoiding pairs of patterns
• Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Further enumeration results concerning a recent equivalence of restricted inversion sequences
• Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
• Restricted inversion sequences and Schröder paths
• On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
• Enumeration of corner polyhedra and 3-connected Schnyder labelings
• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences

This page was built for publication: Five classes of pattern avoiding inversion sequences under one roof: generating trees