Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li

DOI10.47443/dml.2023.012OpenAlexW4323352108WikidataQ123218927 ScholiaQ123218927MaRDI QIDQ5889971

Toufik Mansour

Publication date: 28 April 2023

Published in: Discrete Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.47443/dml.2023.012

zbMATH Keywords

generating treesinversion sequences0021-avoiding inversion sequences

Mathematics Subject Classification ID

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

Related Items

Five classes of pattern avoiding inversion sequences under one roof: generating trees, An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences

Cites Work

• Restricted inversion sequences and enhanced 3-noncrossing partitions
• Length-four pattern avoidance in inversion sequences
• On \(\underline{12} 0\)-avoiding inversion and ascent sequences
• Vincular patterns in inversion sequences
• Wilf equivalences between vincular patterns in inversion sequences
• Patterns in Inversion Sequences I
• Pattern avoidance in inversion sequences
• Inversion sequences avoiding pairs of patterns
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Further enumeration results concerning a recent equivalence of restricted inversion sequences
• Restricted inversion sequences and Schröder paths
• On 0012-avoiding inversion sequences and a conjecture of Lin and Ma