and
Download:
|
|
by Janet S. Beissinger, Uri N. Peled
http://www.combinatorics.org/Volume_4/PostScriptfiles/v4i2r04.ps
Add To MetaCart
Abstract:
A bijection is given from major sequences of length n (a variant of parking functions) to trees on f0; : : : ; ng that maps a sequence with sum \Gamma
Citations
| 74 | Homology and shellability of matroids and geometric lattices – Björner - 1992 |
| 24 | Hyperplane arrangements, parking functions and tree inversions – Stanley - 1998 |
| 22 | Depth-first search as a combinatorial correspondence – Gessel, Wang - 1979 |
| 15 | Hyperplane arrangements, interval orders and trees – Stanley - 1996 |
| 13 | The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions – Gessel, Sagan - 1996 |
| 6 | On external activity and inversions in trees – Beissinger - 1982 |
| 6 | Enumerative applications of a decomposition for graphs and digraphs – Gessel - 1995 |
| 2 | Une famille de polynômes ayant plusiers propriétés énumeratives – Kreweras - 1980 |
