Geodesic
Combinatorial problems connected with P.~Hall's collection process
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 17 (2020), pp. 873-889

Voir la notice de l'article provenant de la source Math-Net.Ru

Let $M_1, \ldots, 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, \ldots, \lambda_r) \in M_1 \times \cdots \times M_r$ that satisfy the condition $C$, where $C$ is a propositional formula consisting of such conditions as $\lambda_i=\lambda_j$, $\lambda_i\lambda_j$, $i,j \in \overline{1,r}$.
Keywords: collection process, Cartesian product, binary weight. 
@article{SEMR_2020_17_a15,
     author = {V. M. Leontiev},
     title = {Combinatorial problems connected with {P.~Hall's} collection process},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {873--889},
     publisher = {mathdoc},
     volume = {17},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2020_17_a15/}
}
TY  - JOUR
AU  - V. M. Leontiev
TI  - Combinatorial problems connected with P.~Hall's collection process
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2020
SP  - 873
EP  - 889
VL  - 17
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2020_17_a15/
LA  - ru
ID  - SEMR_2020_17_a15
ER  - 
%0 Journal Article
%A V. M. Leontiev
%T Combinatorial problems connected with P.~Hall's collection process
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2020
%P 873-889
%V 17
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2020_17_a15/
%G ru
%F SEMR_2020_17_a15
V. M. Leontiev. Combinatorial problems connected with P.~Hall's collection process. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 17 (2020), pp. 873-889. http://geodesic.mathdoc.fr/item/SEMR_2020_17_a15/