Wilf equivalences between vincular patterns in inversion sequences
作者：
Highlights：
• Inversion sequences provide a useful encoding of permutations.
• Patterns in inversion sequences inform the study of permutation patterns.
• We completely classify vincular patterns of length 3 into Wilf equivalence classes.
• Our methods include bijections, inclusion-exclusion, and generating trees.
• We also study more restrictive equivalences by keeping track of pattern occurrences.
摘要
•Inversion sequences provide a useful encoding of permutations.•Patterns in inversion sequences inform the study of permutation patterns.•We completely classify vincular patterns of length 3 into Wilf equivalence classes.•Our methods include bijections, inclusion-exclusion, and generating trees.•We also study more restrictive equivalences by keeping track of pattern occurrences.
论文关键词：Inversion sequence,Pattern avoidance,Vincular pattern,Wilf equivalence,Generating tree
论文评审过程：Received 28 March 2020, Revised 30 June 2020, Accepted 5 July 2020, Available online 23 July 2020, Version of Record 23 July 2020.
论文官网地址：https://doi.org/10.1016/j.amc.2020.125514
