RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2017 Volume 8, Issue 1, Pages 80–94 (Mi mvk216)

This article is cited 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

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.

UDC: 519.212.2+519.115

Received 30.V.2016

DOI: 10.4213/mvk216



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025