組合研討會 主講者: 傅東山 教授 (屏東商業技術學院通識教育中心) 講題: Area of Catalan paths on a checkerboard 時間: 2008-08-08 (Fri.)  14:00 - 15:00 地點: Abstract: This talk explains why the total area below all Dyck paths of semilength $n$ equals the total number of inversions in all 321-avoiding permutations on $n+1$ letters. The authors achieve their purpose with three clearly presented bijections. The first of these is of the cut-and-paste variety and rather technical, reflecting the complication caused by the transition from $n$ to $n+1$, and the other two are quite elegant, involving parallel polyominoes as an intermediate combinatorial construct. || Close window ||