Combinatorial Aspects of the K-Theory of Grassmannians
β Scribed by C. Lenart
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 157 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0218-0006
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the determination of the number c k (Ξ±) of ordered factorizations of an arbitrary permutation on n symbols, with cycle distribution Ξ±, into k-cycles such that the factorizations have minimal length and the group generated by the factors acts transitively on the n symbols. The case k = 2
A finite sequence u = ala2 . up of some symbols is contained in another sequence c = h1b2.. b, if there is a subsequence b,,bi, b,, of u which can be identified, after an injective renaming of symbols, with u. We say that u = u1a2.. .up is k-regular if i -j > k whenever a, = a,, i > j. We denote fur