𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Loopless generation of up–down permutations

✍ Scribed by James F. Korsh

Book ID
108315594
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
247 KB
Volume
240
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Multiset Permutations and Loopless Gener
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
✍ James F. Korsh; Paul LaFollette 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 131 KB

An ordered tree with specified degree sequence and n internal nodes has a i Ž . nodes of degree i, where a s 1 q Ý i y 1 a and n s Ý a . This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for gener

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