Enumerative combinatorics
Random graphs
Combinatorial Enumeration
Cybernetics and Systems Analysis
Works of the Kiev school of theoretical cryptography
Cybernetics and Systems Analysis
Hi-index | 0.00 |
A probabilistic scheme of independent random elements with values in a finite lattice is introduced. For the scheme, exact expressions of probability distributions of a functional of general form and union of random corank elements are obtained. Various probabilistic combinatorial problems (on probability distributions of the number of uncovered points in a generalized scheme of grouped distribution of particles, on the number of connectivity components of a random hypergraph, on the number of solutions of a system of random linear equations over a finite ring with unity, etc.) are demonstrated to be naturally formulated in terms of the scheme constructed.