Using functional equations to enumerate 1324-avoiding permutations
From MaRDI portal
Publication:402577
DOI10.1016/j.aam.2014.01.006zbMath1295.05015arXiv1309.7117OpenAlexW2962885487MaRDI QIDQ402577
Fredrik Johansson, Brian Nakamura
Publication date: 28 August 2014
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7117
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Functional equations and inequalities (39B99)
Related Items
Permutations avoiding 1324 and patterns in Łukasiewicz paths, The design of efficient dynamic programming and transfer matrix enumeration algorithms, Stieltjes moment sequences for pattern-avoiding permutations, Generating permutations with restricted containers, On \(1324\)-avoiding permutations, On pattern avoiding indecomposable permutations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Symmetric functions and P-recursiveness
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Counting 1324-avoiding permutations
- Asymptotic values for degrees associated with strips of Young diagrams
- Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
- Some open problems on permutation patterns
- Approaches for enumerating permutations with a prescribed number of occurrences of patterns
- A New Upper Bound for 1324-Avoiding Permutations
