G-parking functions and tree inversions
- 127 Downloads
A depth-first search version of Dhar’s burning algorithm is used to give a bijection between the parking functions of a graph and labeled spanning trees, relating the degree of the parking function with the number of inversions of the spanning tree. Specializing to the complete graph solves a problem posed by R. Stanley.
Mathematics Subject Classification (2000)05A15 05A19
Unable to display preview. Download preview PDF.
- V. Chvatal and P. L. Hammer: Aggregation of inequalities in integer programming, in: Studies in integer programming (Proc. Workshop, Bonn, 1975), 145–162, Ann. of Discrete Math., Vol. 1. North-Holland, Amsterdam, 1977.Google Scholar
- I. M. Gessel and B. E. Sagan: The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions, Electron. J. Combin., 3(2):Research Paper 9, 1996. The Foata Festschrift.Google Scholar
- A. Guedes de Oliveira and M. Las Vergnas: Parking functions and labeled trees, Sém. Lothar. Combin. 65 (2010/12), Art. B65e, 10.Google Scholar
- A. E. Holroyd, L. Levine, K. Meszaros, Y. Peres, J. Propp and D. B. Wilson: Chipring and rotor-routing on directed graphs, in: In and out of equilibrium. 2, volume 60 of Progr. Probab., 331–364. Birkhlauser, Basel, 2008.Google Scholar
- S. Hopkins and D. Perkinson: Bigraphical arrangements, To appear in Trans. Amer. Math. Soc.; eprint, arXiv:1212.4398, 2012.Google Scholar
- H. Shin: A new bijection between forests and parking functions, eprint, arXiv:0810.0427, 2008.Google Scholar
- R. P. Stanley: An introduction to hyperplane arrangements, in: Geometric combinatorics, volume 13 of IAS/Park City Math. Ser., 389–496, Amer. Math. Soc., Providence, RI, 2007.Google Scholar