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

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


Diskr. Mat., 1989, Volume 1, Issue 1, Pages 125–134 (Mi dm902)  

This article is cited in 6 scientific papers (total in 6 papers)

Permutations with cycle lengths in a given set

A. L. Yakymiv


Full text: PDF file (713 kB)

English version:
Discrete Mathematics and Applications, 1991, 1:1, 105–116

Bibliographic databases:
UDC: 519.12
Received: 27.09.1988

Citation: A. L. Yakymiv, “Permutations with cycle lengths in a given set”, Diskr. Mat., 1:1 (1989), 125–134; Discrete Math. Appl., 1:1 (1991), 105–116

Citation in format AMSBIB
\Bibitem{Yak89}
\by A.~L.~Yakymiv
\paper Permutations with cycle lengths in a~given set
\jour Diskr. Mat.
\yr 1989
\vol 1
\issue 1
\pages 125--134
\mathnet{http://mi.mathnet.ru/dm902}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1072646}
\zmath{https://zbmath.org/?q=an:0728.05004}
\transl
\jour Discrete Math. Appl.
\yr 1991
\vol 1
\issue 1
\pages 105--116


Linking options:
  • http://mi.mathnet.ru/eng/dm902
  • http://mi.mathnet.ru/eng/dm/v1/i1/p125

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. L. Yakymiv, “On permutations with cycle lengths from a random set”, Discrete Math. Appl., 10:6 (2000), 543–551  mathnet  crossref  mathscinet  zmath
    2. A. L. Yakymiv, “Random $A$-Permutations: Convergence to a Poisson Process”, Math. Notes, 81:6 (2007), 840–846  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
    3. A. L. Yakymiv, “Limit theorem for the general number of cycles in a random $A$-permutation”, Theory Probab. Appl., 52:1 (2008), 133–146  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib
    4. A. L. Yakymiv, “Asymptotics of the Moments of the Number of Cycles of a Random $A$-Permutation”, Math. Notes, 88:5 (2010), 759–766  mathnet  crossref  crossref  mathscinet  isi
    5. A. N. Timashev, “Local limit theorems for one class of distributions in probabilistic combinatorics”, Discrete Math. Appl., 28:6 (2018), 405–420  mathnet  crossref  crossref  isi  elib
    6. A. N. Timashev, “Limit Poisson law for the distribution of the number of components in generalized allocation scheme”, Discrete Math. Appl., 29:4 (2019), 255–266  mathnet  crossref  crossref  isi  elib
  • Дискретная математика
    Number of views:
    This page:212
    Full text:110
    First page:2

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021