Processing math: 100%
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, 2019, Volume 31, Issue 3, Pages 114–127
DOI: https://doi.org/10.4213/dm1582
(Mi dm1582)
 

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

Asymptotics with remainder term for moments of the total cycle number of random A-permutation

A. L. Yakymiv

Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
Full-text PDF (481 kB) Citations (4)
References:
Abstract: We consider the set of n-permutations with cycle lengths belonging to some fixed set A of natural numbers (so-called A-permutations). Let random permutation τn be uniformly distributed on this set. For some class of sets A we find the asymptotics with remainder term for moments of total cycle number of τn.
Keywords: random A-permutations, the total number of cycles, the number of cycles of fixed length.
Received: 08.06.2019
English version:
Discrete Mathematics and Applications, 2021, Volume 31, Issue 1, Pages 51–60
DOI: https://doi.org/10.1515/dma-2021-0005
Bibliographic databases:
Document Type: Article
UDC: 519.212.2
Language: Russian
Citation: A. L. Yakymiv, “Asymptotics with remainder term for moments of the total cycle number of random A-permutation”, Diskr. Mat., 31:3 (2019), 114–127; Discrete Math. Appl., 31:1 (2021), 51–60
Citation in format AMSBIB
\Bibitem{Yak19}
\by A.~L.~Yakymiv
\paper Asymptotics with remainder term for moments of the total cycle number of random $A$-permutation
\jour Diskr. Mat.
\yr 2019
\vol 31
\issue 3
\pages 114--127
\mathnet{http://mi.mathnet.ru/dm1582}
\crossref{https://doi.org/10.4213/dm1582}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=866880}
\elib{https://elibrary.ru/item.asp?id=46756477}
\transl
\jour Discrete Math. Appl.
\yr 2021
\vol 31
\issue 1
\pages 51--60
\crossref{https://doi.org/10.1515/dma-2021-0005}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000621785400005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85101549787}
Linking options:
  • https://www.mathnet.ru/eng/dm1582
  • https://doi.org/10.4213/dm1582
  • https://www.mathnet.ru/eng/dm/v31/i3/p114
  • This publication is cited in the following 4 articles:
    1. G. I. Ivchenko, Yu. I. Medvedev, “Sluchainye A-podstanovki v parametricheskoi modeli”, Matem. vopr. kriptogr., 15:1 (2024), 35–55  mathnet  crossref
    2. A. L. Yakymiv, “Moment Characteristics of a Random Mapping with Restrictions on Component Sizes”, Proc. Steklov Inst. Math., 316 (2022), 356–369  mathnet  crossref  crossref  mathscinet
    3. A. L. Yakymiv, “Random mappings with constraints on the cycle lengths”, J. Math. Sci. (N.Y.), 267:2 (2022), 228–233  mathnet  crossref  mathscinet
    4. A. L. Yakymiv, “Variance of the number of cycles of random A-permutation”, Discrete Math. Appl., 32:1 (2022), 59–68  mathnet  crossref  crossref  mathscinet
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:438
    Full-text PDF :86
    References:53
    First page:19
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025