On generation of permutations of \(m\) out of \(n\) items

DOI10.1016/j.ipl.2017.04.001zbMath1409.68319OpenAlexW2604716414WikidataQ60692199 ScholiaQ60692199MaRDI QIDQ2628264

Zbigniew Kokosiński

Publication date: 13 June 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.04.001

zbMATH Keywords

algorithmspermutation generation\((n,m)\)-permutationvariation generationvariation without repetitions

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generation of permutations through decomposition of symmetric groups into cosets
• Encoding and decoding of variations without repetitions
• Parallel Generation of Permutations
• Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups
• A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
• Generating permutations by choosing
• Complete mappings of finite groups

This page was built for publication: On generation of permutations of \(m\) out of \(n\) items