On pattern avoiding indecomposable permutations
From MaRDI portal
Publication:5384205
zbMath1415.05003arXiv1605.05490MaRDI QIDQ5384205
Philip B. Zhang, Alice L. L. Gao, Sergey Kitaev
Publication date: 21 June 2019
Full work available at URL: https://arxiv.org/abs/1605.05490
Related Items (3)
A family of Bell transformations ⋮ On pattern-avoiding Fishburn permutations ⋮ Refined Wilf-equivalences by Comtet statistics
Uses Software
Cites Work
- Using functional equations to enumerate 1324-avoiding permutations
- A bijection between atomic partitions and unsplitable partitions
- Patterns in permutations and words.
- Symmetric functions and P-recursiveness
- Hypermaps and indecomposable permutations
- Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
- Indecomposable permutations, hypermaps and labeled Dyck paths
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Consecutive patterns in permutations
- Counting 1324-avoiding permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- On \(1324\)-avoiding permutations
- A new record for \(1324\)-avoiding permutations
- Generating indecomposable permutations
- Permutations avoiding 1324 and patterns in Łukasiewicz paths
- Generalized permutation patterns -- a short survey
- Generalized pattern avoidance
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On pattern avoiding indecomposable permutations
