论文信息 - A bijective proof of the equation linking the Schro"der numbers, large and small

A bijective proof of the equation linking the Schro"der numbers, large and small

Abstract A bijection is defined between the set of all bushes with n+1 leaves and the set of all Schroder paths of semilength n . This shows bijectively the relation R n =2S n between the large and small Schroder numbers.

Emeric Deutsch

[1] M. Aigner,et al. Motzkin Numbers , 1998, Eur. J. Comb..

[2] D. G. Rogers. THE ENUMERATION OF A FAMILY OF LADDER GRAPHS , 1977 .

[3] Rodica Simion,et al. Some q-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths , 1993 .

[4] D. G. Rogers,et al. Some correspondences involving the schröder numbers and relations , 1978 .

[5] Gérard Viennot,et al. Algebraic Languages and Polyominoes Enumeration , 1983, Theor. Comput. Sci..

[6] Robert A. Sulanke,et al. Bijections for the Schröder Numbers , 2000 .

[7] Robert Donaghey,et al. Motzkin Numbers , 1977, J. Comb. Theory, Ser. A.