The enumeration of inversion sequences avoiding the patterns 201 and 210

DOI10.54550/ECA2024V4S4R25MaRDI QIDQ7034008zbMATH OpenFDO

Authors Jay Pantone

Publication date 1 February 2025

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.54550/ECA2024V4S4R25

zbMATH Keywords

generating functioninversion sequencepattern avoidance

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cites work

• A bijection for length-5 patterns in permutations
• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Consecutive patterns in inversion sequences
• Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
• Enumeration of inversion sequences avoiding triples of relations
• Finitely labeled generating trees and restricted permutations
• Five classes of pattern avoiding inversion sequences under one roof: generating trees
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Inversion sequences avoiding a triple of patterns of 3 letters
• Inversion sequences avoiding pairs of patterns
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Polynomial equations with one catalytic variable, algebraic series and map enumeration
• Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
• Simple marked mesh patterns
• The design of efficient dynamic programming and transfer matrix enumeration algorithms
• The on-line encyclopedia of integer sequences
• Two examples of unbalanced Wilf-equivalence

Cited in

(5)

• Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
• Patterns in rectangulations. I: -like patterns, inversion sequence classes I(010, 101, 120, 201) and I(011, 201), and rushed Dyck paths
• Generating trees growing on the left for pattern-avoiding inversion sequences
• Sorting inversion sequences
• An explicit bijection between the inversion sequences avoiding 0312 and 0321

This page was built for publication: The enumeration of inversion sequences avoiding the patterns 201 and 210

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