Journal of the
Korean Mathematical Society JKMS

ISSN(Print) 0304-9914 ISSN(Online) 2234-3008
qr-code QR
Code

Article

HOME ALL ARTICLES View

J. Korean Math. Soc. 2007; 44(1): 189-198

Printed January 1, 2007

Copyright © The Korean Mathematical Society.

Bijectivity between coin-stacks and permutations avoiding 132-pattern

Hyeong-Kwan Ju and Soonchul Park

Chonnam National University, Kyungpook National University

Abstract

Go to

We have defined a bijective map from certain set of coin-stacks 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

MSC numbers: 05A15

Article Tools

Stats or Metrics

Share this article on :

Related articles in JKMS