Permutations generated by a depth 2 stack and an infinite stack in series are algebraic

Publication Type:
Journal Article
Citation:
Electronic Journal of Combinatorics, 2015, 22 (2)
Issue Date:
2015-04-29
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
perms2infAlgebraic.pdfPublished Version317.35 kB
Adobe PDF
© 2015, Australian National University. All rights reserved. We prove that the class of permutations generated by passing an ordered sequence 12... n through a stack of depth 2 and an in nite stack in series is in bi-jection with an unambiguous context-free language, where a permutation of length n is encoded by a string of length 3n. It follows that the sequence counting the number of permutations of each length has an algebraic generating function. We use the explicit context-free grammar to compute the generating function:(formula presented) where cn is the number of permutations of length n that can be generated, and (formula presented) is a simple variant of the Catalan generating function. This in turn implies that (formula presented)
Please use this identifier to cite or link to this item: