论文信息 - Permutations, parenthesis words, and Schröder numbers - 字舞流文

Permutations, parenthesis words, and Schröder numbers

Abstract A different proof for the following result due to West is given: the Schroder number s n −1 equals the number of permutations on [1,2,..., n ] that avoid the pattern (3,1,4,2) and its dual (2,4,1,3).

G. Rozenberg | A. Ehrenfeucht | T. Harju | P. ten Pas

[1] Nachum Dershowitz,et al. Enumerations of ordered trees , 1980, Discret. Math..

[2] Helmut Prodinger. A correspondence between ordered trees and noncrossing partitions , 1983, Discret. Math..

[3] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..

[4] Julian West,et al. Generating trees and the Catalan and Schröder numbers , 1995, Discret. Math..

[5] Paul H. Edelman. Chain enumeration and non-crossing partitions , 1980, Discret. Math..

[6] Nachum Dershowitz,et al. Ordered trees and non-crossing partitions , 1986, Discret. Math..

[7] Andrzej Ehrenfeucht,et al. T-structures, T-functions, and texts , 1993, Theor. Comput. Sci..

[8] Richard P. Stanley,et al. Hipparchus, Plutarch, Schröder, and Hough , 1997 .

[9] Louis W. Shapiro,et al. Bootstrap Percolation, the Schröder Numbers, and the N-Kings Problem , 1991, SIAM J. Discret. Math..

[10] Tero Harju,et al. Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures , 1996, Theor. Comput. Sci..