Algorithms on Parking Functions and Related Multigraphs

國立高雄大學應用數學系專題演講
主講人：賴俊儒先生（國家科學理論研究中心）
講      題：Algorithms on Parking Functions and Related Multigraphs
演講時間：99年11月24日（星期三）下午2：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.
投影片 http://tinyurl.com/24hojur