A note on permutations and rank aggregation
β Scribed by Geir Dahl; Harald Minken
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 272 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this issue, W.J. Walker introduces the lattice L(n, r) as the set of all possible results when n competitors are matched in a series of r races. A result is an r-term nondecreasing sequence of integers selected from {1, 2 .... , n}. The dimension of L(n, r) is at most r since it is a subposet of
The transitive permutation character (1H) G, where G is a group and H ~ G, is said to be multiplicity-free if each of its irreducible constituents occurs with multiplicity one. The following result, inspired by Gelfand's (1950) work on Riemannian symmetric spaces, and also obtained by Kawanaka and M