Enumeration of inversion sequences avoiding 010 and some patterns of length four

DOI10.15672/HUJMS.1785478MaRDI QIDQ7324376zbMATH OpenFDO

Authors Gökhan Yıldırım

Publication date 3 September 2026

Published in Hacettepe Journal of Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15672/HUJMS.1785478

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Cites work

• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
• Five classes of pattern avoiding inversion sequences under one roof: generating trees
• From permutation patterns to the periodic table
• Generating trees and forbidden subsequences
• Generating trees and the Catalan and Schröder numbers
• Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
• Generating trees growing on the left for pattern-avoiding inversion sequences
• scientific article; zbMATH DE number 2107707 (Why is no real title available?)
• Inversion sequences avoiding 021 and another pattern of length four
• Inversion sequences avoiding pairs of patterns
• Length-four pattern avoidance in inversion sequences
• On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Patterns in permutations and words.

This page was built for publication: Enumeration of inversion sequences avoiding 010 and some patterns of length four

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