Counting pattern avoiding permutations by number of movable letters

DOI10.2298/AADM190706029MMaRDI QIDQ3390785zbMATH OpenOpenAlexFDO

Authors Mark Shattuck, Toufik Mansour

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

pattern avoidancekernel methodvincular patternpermutation statistic

Mathematics Subject Classification ID

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

Recommendations

• Counting set partitions by the number of movable letters
• Generalized pattern avoidance
• On permutations avoiding 1324, 2143, and another 4-letter pattern
• Enumerating pattern avoidance for affine permutations
• Three-letter-pattern avoiding permutations and functional equations

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Classification of bijections between 321- and 132-avoiding permutations
• Expected patterns in permutation classes
• Generalized permutation patterns and a classification of the Mahonian statistics
• Kernel method and linear recurrence system
• Patterns in permutations and words.
• Permutation statistics and \(q\)-Fibonacci numbers
• Permutations and words counted by consecutive patterns
• Refined restricted permutations
• Refining enumeration schemes to count according to permutation statistics
• Restricted 1-3-2 permutations and generalized patterns
• Restricted permutations
• Surprising symmetries in objects counted by Catalan numbers
• The absence of a pattern and the occurrences of another
• The classification of 231-avoiding permutations by descents and maximum drop
• The equidistribution of some length-three vincular patterns on \(S_n(132)\)
• The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2
• Total occurrence statistics on restricted permutations

Cited in

(2)

• Counting set partitions by the number of movable letters
• Vertex degrees in grid graphs of permutations

Describes a project that uses

Uses Software

• AARON
• OEIS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390785)