BIJECTIVITY BETWEEN COIN-STACKS AND PERMUTATIONS AVOIDING 132-PATTERN

Title & Authors
BIJECTIVITY BETWEEN COIN-STACKS AND PERMUTATIONS AVOIDING 132-PATTERN
Ju, Hyeong-Kwan; Park, Soon-Chul;

Abstract
We have defined a bijective map from certain set of coinstacks onto the permutations avoiding 132-pattern and give an algorithm that finds a corresponding permutation from a given coin-stack. We also list several open problems which are similar as a CS-partition problem.
Keywords
CS-partition;pattern avoidance;ordinary coin-stacks(OCS);floated coin-stacks(FCS);LB(or RT)-projection;
Language
English
Cited by
References
1.
M. Bona, A Walk Through Combinatorics, World Scientific, 2002

2.
H.-K. Ju, Classification of the various coin-stacking, Preprint, 2003

3.
H.-K. Ju, An approximation to the Catalan function $\frac{1-\sqrt{1-4x}}{2x}$ and its combinatorial example, submitted, 2005

4.
D. Merlini and R. Sprugnoli, Fountains and histograms, J. Algorithms 44 (2002), no. 1, 159-176

5.
Stephen C. Milne, Restricted growth functions and incidence relations of the lattice of partitions of an n-set, Adv. in Math. 26 (1977), no. 3, 290-305

6.
Andrew M. Odlyzko and Herbert S. Wilf, The editor's corner: n-coins in a fountain, Amer. Math. Monthly 95 (1988), no. 9, 840-843

7.
Peter Paule and Helmut Prodinger, Fountains, Histograms, and q-identities, Discrete Math. Theor. Comput. Sci. 6 (2003), no. 1, 101-106

8.
Richard P. Stanley, Enumerative Combinatorics, vol.2, Cambridge University Press, 1999

9.
D. Stanton and D. White, Constructive Combinatorics Springer-Verlag, 1986

10.
Herbert S. Wilf, Generatingfunctionology (2nd ed.), Academic Press, 1994