
doi: 10.37236/1319
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$.
external activity, major sequences, bijection, parking function, Exact enumeration problems, generating functions, Enumeration in graph theory, Combinatorial identities, bijective combinatorics, Trees
external activity, major sequences, bijection, parking function, Exact enumeration problems, generating functions, Enumeration in graph theory, Combinatorial identities, bijective combinatorics, Trees
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
