Counting pattern avoiding permutations by number of movable letters

Toufik Mansour, Mark Shattuck

Research output: Contribution to journalArticlepeer-review

Abstract

By a movable letter within a pattern avoiding permutation, we mean one that may be transposed with its predecessor while still avoiding the pattern. In this paper, we enumerate permutations avoiding a single pattern of length three according to the number of movable letters, thereby obtaining new q-analogues of the Catalan number sequence. Indeed, we consider the joint distribution with the statistics recording the number of descents and occurrences of certain vincular patterns. To establish several of our results, we make use of the kernel method to solve the functional equations that arise.

Original languageAmerican English
Pages (from-to)260-282
Number of pages23
JournalApplicable Analysis and Discrete Mathematics
Volume15
Issue number2
DOIs
StatePublished - 2021

Keywords

  • Permutation statistic
  • kernel method
  • pattern avoidance
  • vincular pattern

All Science Journal Classification (ASJC) codes

  • Analysis
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Counting pattern avoiding permutations by number of movable letters'. Together they form a unique fingerprint.

Cite this