On (shape-)Wilf-equivalence for words

DOI10.1016/j.aam.2018.05.006zbMath1398.05027arXiv1802.09856OpenAlexW2962709784MaRDI QIDQ1661483

Ting Guo, Yi Zhang, Christian Krattenthaler

Publication date: 16 August 2018

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

wordsFerrers diagramspattern avoidanceWilf-equivalenceshape-Wilf-equivalencegrowth diagramsFerrers shapes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10)

Related Items (3)

Avoiding a pair of patterns in multisets and compositions ⋮ Inversion sequences avoiding a triple of patterns of 3 letters ⋮ Fillings of skew shapes avoiding diagonal patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Patterns in permutations and words.
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Wilf-equivalence on \(k\)-ary words, compositions, and parking functions
• Stirling polynomials
• A new class of Wilf-equivalent permutations
• Signature Catalan combinatorics
• Wilf-equivalence for singleton classes
• Restricted permutations
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent

This page was built for publication: On (shape-)Wilf-equivalence for words