Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells
-
Natalia Yu. Enatskaya
Abstract
For a scheme of allocation of distinguishable particles into indistinguishable cells we describe types of representation, numbering and enumerating of its outcomes in terms of the transition graph; this graph allows, in particular, to find the distribution on the set of outcomes. Several methods of statistical simulation of scheme outcomes are described.
Originally published in Diskretnaya Matematika (2017) 29, №1, 126–135 (in Russian).
References
[1] Sachkov V. N., Introduction to the combinatorial methods of discrete mathematics, M.: MCCME, 2004 (in Russian), 384 pp.Search in Google Scholar
[2] Enatskaya N.Yu., Khakimullin E.R., Stochastic modeling, M.: MIEM, 2012 (in Russian), 185 pp.Search in Google Scholar
[3] AndrewsG. E., “The Theory of Partitions”, Encyclopedia of Mathematics and Its Applications, 2, Addison-Wesley, 1976, 255 pp.Search in Google Scholar
[4] Mansour T., Combinatorics of set partitions., CRC Press, 2012, 600 pp.10.1201/b12691Search in Google Scholar
[5] Orlov M., “Efficient generation of set partitions”, Technical Report, 2002, https://www.cs.bgu.ac.il/orlovm/papers/partitions.pdf.Search in Google Scholar
© 2018 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- On the average-case complexity of underdetermined functions
- Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells
- On groups containing the additive group of the residue ring or the vector space
- A method of graph reduction and its applications
- On the structure of digraphs of polynomial transformations over finite commutative rings with unity
Articles in the same Issue
- Frontmatter
- On the average-case complexity of underdetermined functions
- Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells
- On groups containing the additive group of the residue ring or the vector space
- A method of graph reduction and its applications
- On the structure of digraphs of polynomial transformations over finite commutative rings with unity
