• Communications of the Korean Mathematical Society
• /
• v.14 no.1
• /
• pp.19-29
• /
• 1999

B. Gr nbaum defined the arrangements of simple curves and got many combinatorial properties. In this paper, we studied the existence of (n,r,t,k)-arrangements and the existence of digon-free(n,r,t,k)-arrangements, which is a generalized version of Gr nbaum`s definition.

• Proceedings of the Korean Ceranic Society Conference
• /
• 2000.04a
• /
• pp.19.1-19.1
• /
• 2000

• Proceedings of the Korean Ceranic Society Conference
• /
• 2000.04a
• /
• pp.19.2-19.2
• /
• 2000

• 한국생물공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.626-626
• /
• 2005

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2006.08a
• /
• pp.67-67
• /
• 2006

• Bulletin of the Korean Chemical Society
• /
• v.32 no.7
• /
• pp.2453-2456
• /
• 2011

• Proceedings of the Korean Ceranic Society Conference
• /
• 2000.10a
• /
• pp.56.1-56
• /
• 2000

• Proceedings of the Korean Ceranic Society Conference
• /
• 2000.10a
• /
• pp.56.2-56
• /
• 2000

• Proceedings of the Korean Ceranic Society Conference
• /
• 2000.10a
• /
• pp.57.2-57
• /
• 2000

• Korean Journal of Mathematics
• /
• v.14 no.1
• /
• pp.125-136
• /
• 2006

Using the Bumping algorithm for the shifted rim hook tableaux described in [5], we construct Schensted insertion and deletion algorithms for shifted rim hook tableaux. This may give us the combinatorial proof for the orthogonality of the second kind of the spin characters of $S_n$.