On generation of permutations of m out of n items
Authors:
- Zbigniew Kokosiński
Abstract
New algorithms are proposed for generation of (n, m) -permutations, 1 ≤ m ≤ n. The representation of (n , m)-permutations is derived from m -level iterative decomposition of symmetric permutation group S n into cosets. The control sequence produced by the generation algorithms appears in lexicographic order while the output sequence is obtained from the control sequence in a linear order. Ranking and unranking schemes for control sequences are given. An implementation of a hardware generator of (n , m)-permutations by means of a cellular interconnection network is described.
- Record ID
- CUTcd27dfa91e91475bb30e52a21f0aea69
- Publication categories
- ;
- Author
- Journal series
- Information Processing Letters, ISSN 0020-0190, e-ISSN 1872-6119
- Issue year
- 2017
- Vol
- 124
- Pages
- 1-5
- Other elements of collation
- schem.; tab.; Bibliografia (na s.) - 5; Bibliografia (liczba pozycji) - 18; Oznaczenie streszczenia - Abstr.; Numeracja w czasopiśmie - Vol. 124
- Keywords in English
- algorithms, (n, m)-permutation, permutation generation, variation without repetitions, variation generation
- DOI
- DOI:10.1016/j.ipl.2017.04.001 Opening in a new tab
- URL
- http://www.sciencedirect.com/science/article/pii/S0020019017300509 Opening in a new tab
- Language
- eng (en) English
- Score (nominal)
- 20
- Publication indicators
- = 0
- Additional fields
- Indeksowana w: Web of Science, Scopus
- Uniform Resource Identifier
- https://cris.pk.edu.pl/info/article/CUTcd27dfa91e91475bb30e52a21f0aea69/
- URN
urn:pkr-prod:CUTcd27dfa91e91475bb30e52a21f0aea69
* presented citation count is obtained through Internet information analysis, and it is close to the number calculated by the Publish or PerishOpening in a new tab system.