본문 바로가기
KERD
논문KCI 등재

Bijectivity between coin-stacks and permutations avoiding132-pattern

0

조회

0

다운로드

0

인용

0

참고문헌

주제분류수학

초록

Abstract

We have dened a bijective map from certain set of coin-stacks onto the permutations avoiding 132-patern and give an algorithmthat nds a coresponding permutation from a given coin-sta ck. We alsolist several open problems which are similar as a CS-partition problem.

참고문헌 (5)

  1. "A Walk Through Combinatorics"
  2. "Clasication of the various coin-stacking"
  3. "An aproximation to the Catalan function 1√14x2x and its combinatorialexample"
  4. "Restricted growth functions and incidence relations of the latice ofpartitions of an n-set", pp.290~305
  5. "n-coins in a fountain", pp.~95

관련 논문AI추천

이 간행물의 다른 논문 (14건)