演講者：
單 位：
日 期：2010年11月24日 PM 14:30
地 點：國立高雄大學理學院408室
講 題：
摘 要：
Parking functions were introduced and enumerated by Konhein and Weiss in a study of hashing problems in computer science. Its structure is realted to labeled trees, critical configurations of the dollar game and alcoves for affine Coxeter arrangement. In this talk, we will introduce various generalizations of parking functions, their related multigraphs and two enumerative methods: the triple-labeled algorithm establishes a family of bijections between generalized parking functions and multigraphs, while the cycle lemma for words leads to results with restrictions such as symmetry and periodic property.