Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps
Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating functionH(x) of all 1342-avoiding permutations of lengthnas well as anexactformula for their numberSn(1342). While achieving this, we bijectively prove that the number of indecomposa...
Saved in:
| Published in: | Journal of combinatorial theory. Series A Vol. 80; no. 2; pp. 257 - 272 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.11.1997
|
| ISSN: | 0097-3165, 1096-0899 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!