Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics

DOI10.1016/j.aam.2018.10.001zbMath1402.05003arXiv1807.04921OpenAlexW2962700989MaRDI QIDQ1755656

Mitchell Lee, Ashwin Sah

Publication date: 10 January 2019

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

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

zbMATH Keywords

permutationasymptotic enumerationlinear extensionconsecutive patterncluster method

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Asymptotic enumeration (05A16)

Related Items (3)

Wilf equivalences for patterns in rooted labeled forests ⋮ 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
• Minimal overlapping patterns in colored permutations
• Permutations and words counted by consecutive patterns
• Average height in a partially ordered set
• Faster random generation of linear extensions
• Consecutive patterns in permutations
• Wilf equivalence relations for consecutive patterns
• Clusters, generating functions and asymptotics for consecutive patterns in permutations
• Asymptotic enumeration of permutations avoiding generalized patterns
• 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
• The most and the least avoided consecutive patterns

This page was built for publication: Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics