|
This article is cited in 1 scientific paper (total in 1 paper)
A recurrent algorithm for solving a combinatorial problem on arrangements with restrictions
I. I. Trub
Abstract:
We consider $N$ groups of elements such that the elements in different
groups are distinct and each group consists of $Q$ identical elements.
How many ways are there to arrange these $QN$ elements so that
the permutation obtained contains exactly $L$ pairs of adjacent identical
elements, $0\leq L\leq N(Q-1)$?
The particular case $L=0$ corresponds to calculating the number of
permutations with no two adjacent identical elements. We suggest a recurrent algorithm for solving the problem and its
generalization to the case where the groups may contain different numbers of
elements.
Received: 05.08.1991 Revised: 09.01.1999
Citation:
I. I. Trub, “A recurrent algorithm for solving a combinatorial problem on arrangements with restrictions”, Diskr. Mat., 11:2 (1999), 112–117; Discrete Math. Appl., 9:2 (1999), 211–216
Linking options:
https://www.mathnet.ru/eng/dm376https://doi.org/10.4213/dm376 https://www.mathnet.ru/eng/dm/v11/i2/p112
|
Statistics & downloads: |
Abstract page: | 566 | Full-text PDF : | 214 | First page: | 1 |
|