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, 1999, Volume 11, Issue 1, Pages 53–75
DOI: https://doi.org/10.4213/dm358 (Mi dm358) 		 
This article is cited in 14 scientific papers (total in 14 papers)

Matchings up to permutations in a sequence of independent trials

S. M. Buravlev
Full-text PDF (1571 kB) Citations (14)
DOI: https://doi.org/10.4213/dm358
Abstract: We consider random characteristics associated with matchings, up to permutations of outcomes, of tuples in a sequence of independent polynomial trials and generalize the well-known results due to A. M. Zubkov and V. G. Mikhailov.
Received: 15.10.1996
Revised: 16.09.1998
Bibliographic databases:
UDC: 519.2
Language: Russian
Citation: S. M. Buravlev, “Matchings up to permutations in a sequence of independent trials”, Diskr. Mat., 11:1 (1999), 53–75; Discrete Math. Appl., 9:1 (1999), 53–78
Citation in format AMSBIB
\Bibitem{Bur99}
\by S.~M.~Buravlev
\paper Matchings up to permutations in a sequence of independent trials
\jour Diskr. Mat.
\yr 1999
\vol 11
\issue 1
\pages 53--75
\mathnet{http://mi.mathnet.ru/dm358}
\crossref{https://doi.org/10.4213/dm358}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1702928}
\zmath{https://zbmath.org/?q=an:0973.60020}
\transl
\jour Discrete Math. Appl.
\yr 1999
\vol 9
\issue 1
\pages 53--78
Linking options:
  • https://www.mathnet.ru/eng/dm358
  • https://doi.org/10.4213/dm358
  • https://www.mathnet.ru/eng/dm/v11/i1/p53
    • This publication is cited in the following 14 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:453
    Full-text PDF :234
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024