Visibility in pattern-restricted permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 729555 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Combinatorial parameters in bargraphs
- Counting visible levels in bargraphs and set partitions
- Enumerations on bargraphs
- Kernel method and linear recurrence system
- Levels in bargraphs
- 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 permutations
- 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
Cited in
(5)
This page was built for publication: Visibility in pattern-restricted permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4991426)