Counting pattern avoiding permutations by number of movable letters

DOI10.2298/AADM190706029MzbMath1499.05046OpenAlexW3095512957MaRDI QIDQ3390785

Toufik Mansour, Mark Shattuck

Publication date: 25 March 2022

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/aadm190706029m

zbMATH Keywords

kernel methodpattern avoidancevincular patternpermutation statistic

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Uses Software

• OEIS
• AARON

Cites Work

• Unnamed Item
• Unnamed Item
• Refining enumeration schemes to count according to permutation statistics
• Surprising symmetries in objects counted by Catalan numbers
• Expected patterns in permutation classes
• Patterns in permutations and words.
• Permutations and words counted by consecutive patterns
• The classification of 231-avoiding permutations by descents and maximum drop
• The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2
• Refined restricted permutations
• Generalized permutation patterns and a classification of the Mahonian statistics
• The equidistribution of some length-three vincular patterns on \(S_n(132)\)
• Restricted 1-3-2 permutations and generalized patterns
• Permutation statistics and \(q\)-Fibonacci numbers
• Kernel method and linear recurrence system
• Total occurrence statistics on restricted permutations
• The absence of a pattern and the number of occurrences of another
• Restricted permutations

This page was built for publication: Counting pattern avoiding permutations by number of movable letters