Wilf equivalence relations for consecutive patterns

DOI10.1016/j.aam.2018.04.007zbMath1388.05007arXiv1801.08262OpenAlexW2964087901MaRDI QIDQ1637600

Sergi Elizalde, Tim Dwyer

Publication date: 8 June 2018

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

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

zbMATH Keywords

posetpermutationconsecutive pattern\(c\)-Wilf equivalencecluster methodsuper-strong

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)

Related Items

Consecutive patterns in inversion sequences II: avoiding patterns of relations, Wilf equivalences for patterns in rooted labeled forests, Inversion sequences avoiding consecutive patterns, Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics, Counting Linear Extensions of Posets with Determinants of Hook Lengths, Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations, Classical and consecutive pattern avoidance in rooted forests, A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra

Uses Software

• CAV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shuffle algebras, homology, and consecutive pattern avoidance
• Using homological duality in consecutive pattern avoidance
• Minimal overlapping patterns in colored permutations
• Permutations and words counted by consecutive patterns
• Forbidden subsequences
• Consecutive patterns in permutations
• A new class of Wilf-equivalent permutations
• On super-strong Wilf equivalence classes of permutations
• Clusters, generating functions and asymptotics for consecutive patterns in permutations
• Wilf-equivalence for singleton classes
• Computational Approaches to Consecutive Pattern Avoidance in Permutations
• A survey of consecutive patterns in permutations
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• On the Rearrangement Conjecture for Generalized Factor Order Over $\mathbb{P}$
• The most and the least avoided consecutive patterns
• Permutations with given peak set