论文信息 - Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations

Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations

An encoding of the set of two-stack-sortable permutations (TSS) in terms of lattice paths and ordered lists of strings is obtained. These lattice paths are called Raney paths. The encoding yields combinatorial decompositions for two complementary subsets of TSS, which are the analogues of previously known decompositions for the set of nonseparable rooted planar maps (NS). This provides a combinatorial relationship between TSS and NS, and, hence, a bijection is determined between these sets that is different, simpler, and more refined than the previously known bijection.

Julian West | Ian P. Goulden

[1] W. G. Brown,et al. Enumeration of Non-Separable Planar Maps , 1963, Canadian Journal of Mathematics.

[2] Donald Ervin Knuth,et al. The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information , 1978 .

[3] Doron Zeilberger,et al. A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!) , 1992, Discret. Math..

[4] Ira M. Gessel,et al. A noncommutative generalization and $q$-analog of the Lagrange inversion formula , 1980 .

[5] G. N. Raney. Functional composition patterns and power series reversion , 1960 .

[6] W. T. Tutte,et al. On the Enumeration of Rooted Non-Separable Planar Maps , 1964, Canadian Journal of Mathematics.

[7] Serge Dulucq,et al. Permutations with forbidden subsequences and nonseparable planar maps , 1996, Discret. Math..

[8] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[9] W. T. Tutte. A Census of Planar Maps , 1963, Canadian Journal of Mathematics.