Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2017, Volume 29, Issue 1, Pages 126–135
DOI: https://doi.org/10.4213/dm1410 (Mi dm1410) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells

N. Yu. Enatskaya

National Research University "Higher School of Economics" (HSE), Moscow
Full-text PDF (696 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1410
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.
Keywords: allocation of particles into cells, indistinguishable cells, statistical simulation.
Received: 07.05.2015
Revised: 15.07.2015
English version:
Discrete Mathematics and Applications, 2018, Volume 28, Issue 4, Pages 223–230
DOI: https://doi.org/10.1515/dma-2018-0020
Bibliographic databases:
Document Type: Article
UDC: 519.115
Language: Russian
Citation: N. Yu. Enatskaya, “Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells”, Diskr. Mat., 29:1 (2017), 126–135; Discrete Math. Appl., 28:4 (2018), 223–230
Citation in format AMSBIB
\Bibitem{Ena17}
\by N.~Yu.~Enatskaya
\paper Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 1
\pages 126--135
\mathnet{http://mi.mathnet.ru/dm1410}
\crossref{https://doi.org/10.4213/dm1410}
\elib{https://elibrary.ru/item.asp?id=28405140}
\transl
\jour Discrete Math. Appl.
\yr 2018
\vol 28
\issue 4
\pages 223--230
\crossref{https://doi.org/10.1515/dma-2018-0020}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000442245400002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053150781}
Linking options:
  • https://www.mathnet.ru/eng/dm1410
  • https://doi.org/10.4213/dm1410
  • https://www.mathnet.ru/eng/dm/v29/i1/p126
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:430
    Full-text PDF :114
    References:56
    First page:35
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024