𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithm for the enumeration of permutations with finite repetition

✍ Scribed by B. M. Zlotnik

Publisher
Springer US
Year
1971
Tongue
English
Weight
172 KB
Volume
7
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Enumeration of Permutations with a P
The Enumeration of Permutations with a Prescribed Number of β€œForbidden” Patterns
✍ John Noonan; Doron Zeilberger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 219 KB

We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of ''forbidden'' patterns that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method completely in terms of the patterns ''abc, '' ''cab,'' and ''

Enumerating pairs of permutations with t
Enumerating pairs of permutations with the same up-down form
✍ C.L Mallows; L.A Shepp πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 482 KB

For each sequence q = {qi} = Β±1, i = 1 ..... n -1 let Nq = the number of permutations tr of 1, 2 ..... n with up-down sequence sgn(tri+x-tri) = th, i = 1 ..... n -1. Clearly Y.q (Nqln!) = 1 but what is the probability p, = Y.q (NJn!) 2 that two random permutations have the same up-down sequence? We

A loopless algorithm for generating the
A loopless algorithm for generating the permutations of a multiset
✍ Vincent Vajnovszki πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 372 KB

Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shu e on trajectories (deΓΏned previou

A CAT algorithm for generating permutati
A CAT algorithm for generating permutations with a fixed number of inversions
✍ Scott Effler; Frank Ruskey πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 103 KB

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for the generation of permutations with given index.