Journal of the Korean Mathematical Society (대한수학회지)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

BIJECTIVITY BETWEEN COIN-STACKS AND PERMUTATIONS AVOIDING 132-PATTERN

  • Published : 2007.01.31
Download PDF
⟨ Previous Next ⟩

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

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 https://doi.org/10.1016/S0196-6774(02)00211-0
  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 https://doi.org/10.1016/0001-8708(77)90043-3
  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 https://doi.org/10.2307/2322898
  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