Inversion sequences avoiding {120,210} and another pattern of length three

DOI10.1080/10236198.2024.2409783MaRDI QIDQ7007594zbMATH OpenFDO

Authors Toufik Mansour, Qiqi Xiao

Publication date 26 March 2025

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

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

Mathematics Subject Classification ID

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

Cites work

• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
• Enumeration of inversion sequences avoiding triples of relations
• Five classes of pattern avoiding inversion sequences under one roof: generating trees
• Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
• Inversion sequences avoiding a triple of patterns of 3 letters
• Inversion sequences avoiding pairs of patterns
• Kernel method and linear recurrence system
• Length-four pattern avoidance in inversion sequences
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations

This page was built for publication: Inversion sequences avoiding {120,210} and another pattern of length three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007594)