arXiv Analytics

Sign in

arXiv:1008.2375 [math.CO]AbstractReferencesReviewsResources

A bijection to count (1-23-4)-avoiding permutations

David Callan

Published 2010-08-13Version 1

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the previously known 4-variable recurrence. At the heart of the proof is a bijection from (1-23-4)-avoiding permutations to increasing ordered trees whose leaves, taken in preorder, are also increasing.

Comments: latex, 16 pages
Categories: math.CO
Subjects: 05A15
Related articles: Most relevant | Search more
arXiv:1111.3088 [math.CO] (Published 2011-11-14, updated 2011-12-29)
The number of bar{3}bar{1}542-avoiding permutations
arXiv:0909.4732 [math.CO] (Published 2009-09-25, updated 2010-02-23)
A Natural Bijection between Permutations and a Family of Descending Plane Partitions
arXiv:0903.2555 [math.CO] (Published 2009-03-14)
Equidistribution of (X,Y)-descents, (X,Y)-adjacent pairs, and (X,Y)-place-value pairs on permutations

Links

Toolbox