The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent

DOI10.1515/dma.1996.6.1.41zbMath0847.05002OpenAlexW2031900792MaRDI QIDQ4889742

Vladimir A. Vatutin

Publication date: 12 August 1996

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1996.6.1.41

zbMATH Keywords

permutationrandom permutationasymptotically independentdescendent setnumbers of ascending segments

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (7)

A central limit theorem for descents of a Mallows permutation and its inverse ⋮ On the central limit theorem for the two-sided descent statistics in Coxeter groups ⋮ Distribution of descents in matchings ⋮ A central limit theorem for descents and major indices in fixed conjugacy classes of \(S_n\) ⋮ A central limit theorem for a new statistic on permutations ⋮ Central limit theorem for descents in conjugacy classes of \(S_n\) ⋮ A central limit theorem for the two-sided descent statistic on Coxeter groups

This page was built for publication: The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent