Тип публикации: статья из журнала
Год издания: 2020
Идентификатор DOI: 10.33048/semi.2020.17.064
Ключевые слова: collection process, cartesian product, binary weight
Аннотация: Let M-1,... , M-r be nonempty subsets of any totally ordered set. Imposing some restricitons on these subsets, we find an expression for the number of elements (lambda(1), ...,lambda(r)) is an element of M-1 x ... x M-r that satisfy the condition C, where C is a propositional formula consisting of such conditions as lambda(i) = lamПоказать полностьюbda(j), lambda(i) . Let M1, …, Mr be nonempty subsets of any totally ordered set. Imposing some restricitons on these subsets, we find an expression for the number of elements (λ1, …, λr) ε M1 × ··· x Mr that satisfy the condition C, where C is a propositional formula consisting of such conditions as λi = λj, λi < λj, i, j ε 1, r. © 2020. All rights reserved.
Журнал: SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA
Выпуск журнала: Vol. 17
Номера страниц: 873-889
ISSN журнала: 18133304
Место издания: NOVOSIBIRSK
Издатель: SOBOLEV INST MATHEMATICS