A duality of distinct partitions

スポンサーリンク

概要

• 論文の詳細を見る

• For each subset A of Ω={1,2,…,n-1}, we consider the number e(A) of ways of arranging n pebbles without empty rows or columns on the Young diagram whose row length set is just AU{n}, and prove that e(A)=e(*A*),where*A*is the complementary set in Ω of the set of complementary numbers w. r. t. n of the numbers in A. We also give a diagrammatic algorithm for computing e(A).

• 東京工芸大学の論文
• 1989-01-15

著者

• Ueno Yoshiaki

  The Faculty Of Engineering Tokyo Institute Of Polytechnics

関連論文

• Frags and matchings
• A duality of distinct partitions
• An odd pair of axioms bring semigroups fairly near the group

スポンサーリンク