Inversion sequences avoiding a set of length-3 patterns

MaRDI QIDQ6943872zbMATH OpenFDO

Authors Toufik Mansour

Publication date 12 August 2025

Published in Integers (Search for Journal in Brave)

Full work available at URL https://math.colgate.edu/~integers/y76/y76.pdf

zbMATH Keywords

pattern-avoidance for inversion sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75) Special sequences and polynomials (11B83)

Cites work

• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Enumeration and Wilf-classification of permutations avoiding five patterns of length 4
• Enumeration of inversion sequences avoiding triples of relations
• Generating trees and forbidden subsequences
• Inversion sequences avoiding a triple of patterns of 3 letters
• Inversion sequences avoiding pairs of patterns
• Inversion sequences avoiding quadruple length-3 patterns
• Kernel method and linear recurrence system
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Restricted inversion sequences and Schröder paths
• Restricted permutations
• Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence

This page was built for publication: Inversion sequences avoiding a set of length-3 patterns

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