Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps
- 30 November 1997
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 80 (2) , 257-272
- https://doi.org/10.1006/jcta.1997.2800
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- The Number of Permutations with Exactlyr132-Subsequences IsP-Recursive in the Size!Advances in Applied Mathematics, 1997
- The Enumeration of Permutations with a Prescribed Number of “Forbidden” PatternsAdvances in Applied Mathematics, 1996
- Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable PermutationsJournal of Combinatorial Theory, Series A, 1996
- Permutations with forbidden subsequences and nonseparable planar mapsDiscrete Mathematics, 1996
- The number of permutations containing exactly one increasing subsequence of length threeDiscrete Mathematics, 1996
- Forbidden subsequencesDiscrete Mathematics, 1994
- Symmetric functions and P-recursivenessJournal of Combinatorial Theory, Series A, 1990
- Restricted PermutationsEuropean Journal of Combinatorics, 1985
- Asymptotic values for degrees associated with strips of young diagramsAdvances in Mathematics, 1981
- Differentiably Finite Power SeriesEuropean Journal of Combinatorics, 1980