Generalized parking functions, tree inversions, and multicolored
Institute of Advanced Study and TAMU
refreshments at 3:45pm
A depth first search algorithm has been used by Gessel and Wang to
establish the connection between labeled connected graphs and
inversions of trees. In this talk, we extend this algorithm to
certain multicolored graphs. We also introduce a breadth first
search algorithm which gives the connection between multicolored
graphs and generalized parking functions. Combining these results,
we prove an identity between the inversion enumerator of sequences
of labeled forests, and the sum enumerator of generalized parking
Speaker's Contact Info: yancath(at-sign)ias.edu
Return to seminar home page
Page loaded on October 26, 2000 at 01:56 PM.
Copyright © 1998-99, Sara C. Billey.
All rights reserved.