Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2017, Volume 8, Issue 1, Pages 80–94
DOI: https://doi.org/10.4213/mvk216 (Mi mvk216) 		 
This article is cited in 2 scientific papers (total in 2 papers)

The number of decomposition of random permutation into the product of two involutions with given cycle in one of multipliers

V. G. Mikhailov

Steklov Mathematical Institute of the Russian Academy of Sciences, Moscow
Full-text PDF (184 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk216
Abstract: We investigate the number of decompositions of random permutation of the $n$-th order into the product of two involutions with given cycle in one of multipliers. Theorems on the asymptotical logarithmic normality of this number as $n\to\infty$ are proved.
Key words: random permutations, decomposition of permutation, product of involutions, asymptotic logarithmic normality.
Received 30.V.2016
Bibliographic databases:
Document Type: Article
UDC: 519.212.2+519.115
Language: Russian
Citation: V. G. Mikhailov, “The number of decomposition of random permutation into the product of two involutions with given cycle in one of multipliers”, Mat. Vopr. Kriptogr., 8:1 (2017), 80–94
Citation in format AMSBIB
\Bibitem{Mik17}
\by V.~G.~Mikhailov
\paper The number of decomposition of random permutation into the product
of two involutions with given cycle in one of multipliers
\jour Mat. Vopr. Kriptogr.
\yr 2017
\vol 8
\issue 1
\pages 80--94
\mathnet{http://mi.mathnet.ru/mvk216}
\crossref{https://doi.org/10.4213/mvk216}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3682440}
\elib{https://elibrary.ru/item.asp?id=29864941}
Linking options:
  • https://www.mathnet.ru/eng/mvk216
  • https://doi.org/10.4213/mvk216
  • https://www.mathnet.ru/eng/mvk/v8/i1/p80
    • 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:338
    Full-text PDF :163
    References:46
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024