Results 241 to 250 of about 108,510 (269)

Permutation enumeration

Communications of the ACM, 1976
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The
openaire   +2 more sources

Sets of permutations and their realization by permutation networks

J. Inf. Process. Cybern., 1985
The realization of sets of permutations by permutation networks which are serial connections of some layers with only one binary control input for each layer are systematically investigated.
Ferdinand Börner, Reinhard Pöschel, Michael Gössel   +2 more
openaire   +1 more source

Permutation Numbers

Complex Systems, 2004
This paper investigates some series of integers which are derived from a recursively defined sequence of permutations of words. Such a recursion can be interpreted as a dynamic system. Geometrical representations of these series appear to be self-similar, symmetrical, and factorizable.
openaire   +2 more sources

Permutations and Permutation Matrices

2008
Myoung An, Andrzej K. Brodzik, Richard Tolimieri   +2 more
openaire   +1 more source

Characterization of quasirandom permutations by a pattern sum

Random Structures and Algorithms, 2020
Jan Volec, Maryam Sharifzadeh
exaly  

Regenerative random permutations of integers

Annals of Probability, 2019
Wenpin Tang
exaly  

Permutations with Restricted Patterns and Dyck Paths

Advances in Applied Mathematics, 2001
C Krattenthaler
exaly  

Enumeration of permutations by number of alternating runs

Discrete Mathematics, 2013
Shi-Mei Ma
exaly  

APN permutations on Zn and Costas arrays

Discrete Applied Mathematics, 2009
Gary Mcguire, Rod Gow
exaly  

Common Intervals of Multiple Permutations

Algorithmica, 2009
Steffen Heber, Jens Stoye, Stoye Jens
exaly