Counting pattern avoiding permutations by number of movable letters
From MaRDI portal
Publication:3390785
DOI10.2298/AADM190706029MzbMATH Open1499.05046OpenAlexW3095512957MaRDI QIDQ3390785FDOQ3390785
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Refined restricted permutations
- Restricted permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- Patterns in permutations and words.
- Permutations and words counted by consecutive patterns
- Title not available (Why is that?)
- Surprising symmetries in objects counted by Catalan numbers
- Expected patterns in permutation classes
- Restricted 1-3-2 permutations and generalized patterns
- Total occurrence statistics on restricted permutations
- The absence of a pattern and the occurrences of another
- Refining enumeration schemes to count according to permutation statistics
- The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2
- Kernel method and linear recurrence system
- The classification of 231-avoiding permutations by descents and maximum drop
- Permutation statistics and \(q\)-Fibonacci numbers
- The equidistribution of some length-three vincular patterns on \(S_n(132)\)
Uses Software
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)