𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for compositions of a multiset

✍ Scribed by Peter H Sellers

Book ID
107884876
Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
491 KB
Volume
24
Category
Article
ISSN
0097-3165

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

An extremal problem for antichains of su
An extremal problem for antichains of subsets of a multiset
✍ G.F. Clements πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 850 KB

A multiset M is a finite set consisting of several different kinds of elements, and an antichain F is a set of incomparable subsets of M. With P and \_F denoting respectively the set of subsets which contain an element of F or are contained in an element of F, we find the best upper bound for min(lF

An Equipartition Property for the Distri
An Equipartition Property for the Distribution of Multiset Permutation Inversions
✍ S. Brunetti; A. Del Lungo; F. Del Ristoro πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 91 KB

The purpose of this paper is to present some enumerative results concerning the class k of permutations of the multiset 1 m 1 2 m 2 r m r having inversion number congruent to k modulo n, with n = m 1 + m 2 + β€’ β€’ β€’ + m r and 0 ≀ k < n. We show that the enumeration of this family of permutations is co