Author:
Beissinger Janet S.,Peled Uri N.
Abstract
A bijection is given from major sequences of length $n$ (a variant of parking functions) to trees on $\{0,\ldots,n\}$ that maps a sequence with sum ${{n+1}\choose 2} + k$ to a tree with external activity $k$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献