Article contents
Representation of permutations as products of cycles of fixed length
Published online by Cambridge University Press: 09 April 2009
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
We study the problem of representing a permutation C as a product of a minimum number, fk(C), of cycles of length k. Upper and lower bounds on fk(C) are obtained and exact results are derived for k = 2, 3, 4.
- Type
- Research Article
- Information
- Journal of the Australian Mathematical Society , Volume 22 , Issue 3 , November 1976 , pp. 321 - 331
- Copyright
- Copyright © Australian Mathematical Society 1976
References
Feit, W., Lyndon, R., and Scott, L. (1975), ‘A remark about permutations’, J. Combinatorial Theory 18, 234–235.Google Scholar
Ree, R. (1971), ‘A theorem on permutations’, J. Combinatorial Theory 10, 174–175.CrossRefGoogle Scholar
- 5
- Cited by