Representing random permutations as the product of two involutions
Online Journal of Analytic Combinatorics · 2016
DOI: 10.61091/ojac-1106 ↗Kurz gefasst
Fachartikel in der Zeitschrift Online Journal of Analytic Combinatorics, 2016. Verfasst von Charles Burnette und 1 weiteren Autor:innen.
Abstract (Originalsprache)
An involution is a permutation that is its own inverse. Given a permutation \(\sigma\) of \([n]\), let \(N_n(\sigma)\) denote the number of ways to write \(\sigma\) as a product of two involutions of \([n]\). If we endow the symmetric groups \(S_n\) with uniform probability measures, then the random variables \(N_n\) are asymptotically lognormal. The proof is based upon the observation that, for most permutations \(\sigma\), \(N_n(\sigma)\) can be well-approximated by \(B_n(\sigma)\), the product of the cycle lengths of \(\sigma\). Asymptotic lognormality of \(N_n\) can therefore be deduced from Erdős and Turán's theorem that \(B_n\) is itself asymptotically lognormal.
Zitieren
APA
Burnette, C., & Schmutz, E. (2016). Representing random permutations as the product of two involutions. Online Journal of Analytic Combinatorics. https://doi.org/10.61091/ojac-1106
Vancouver
Burnette C, Schmutz E. Representing random permutations as the product of two involutions. Online Journal of Analytic Combinatorics. 2016. doi:10.61091/ojac-1106
BibTeX
@article{Burnette2016,
author = {Burnette, Charles and Schmutz, Eric},
title = {Representing random permutations as the product of two involutions},
journal = {Online Journal of Analytic Combinatorics},
year = {2016},
doi = {10.61091/ojac-1106}
}
EUVIMED