An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences

DOI10.1016/j.jsc.2023.102231zbMath1519.05008arXiv2210.04489OpenAlexW4377020029WikidataQ130258091 ScholiaQ130258091MaRDI QIDQ6170819

Ilias S. Kotsireas, Toufik Mansour, Gökhan Yıldırım

Publication date: 10 August 2023

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.04489

zbMATH Keywords

generating functionskernel methodgenerating treesCatalan numbersMotzkin numberspattern-avoiding inversion sequences

Mathematics Subject Classification ID

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

Related Items (4)

Restricted inversion sequences and Schröder paths ⋮ Five classes of pattern avoiding inversion sequences under one roof: generating trees ⋮ Inversion sequences avoiding a triple of patterns of 3 letters ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Patterns in permutations and words.
• Pattern avoidance in ascent sequences
• On pattern-avoiding partitions
• Enumeration schemes and, more importantly, their automatic generation
• Generating functions for generating trees
• Enumeration of inversion sequences avoiding triples of relations
• Restricted inversion sequences and enhanced 3-noncrossing partitions
• Finite automata and pattern avoidance in words
• Generating trees and forbidden subsequences
• Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes
• Length-four pattern avoidance in inversion sequences
• On \(\underline{12} 0\)-avoiding inversion and ascent sequences
• Patterns of relation triples in inversion and ascent sequences
• Vincular patterns in inversion sequences
• Increasing consecutive patterns in words
• Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
• 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
• Enumeration Schemes for Restricted Permutations
• 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
• On 0012-avoiding inversion sequences and a conjecture of Lin and Ma

This page was built for publication: An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences