• 대한수학회지
• /
• 제44권1호
• /
• pp.189-198
• /
• 2007

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.