Descent-inversion statistics in riffle shuffles

DOI10.3906/mat-1610-59zbMath1424.05001arXiv1303.2387OpenAlexW2128475775WikidataQ130070645 ScholiaQ130070645MaRDI QIDQ4634111

Ümit Işlak

Publication date: 7 May 2019

Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.2387

zbMATH Keywords

descentsrandom permutationsinversionslongest alternating subsequencesrandom wordsriffle shuffles

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (1)

Asymptotic results on weakly increasing subsequences in random words

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of Stein's method
• Generalized Galois numbers, inversions, lattice paths, ferrers diagrams and limit theorems
• A probabilistic approach to the asymptotics of the length of the longest alternating subsequence
• Convergence rates for generalized descents
• Longest alternating subsequences of permutations
• Trailing the dovetail shuffle to its lair
• The combinatorics of biased riffle shuffles
• Normal approximation under local dependence.
• The number of flags in finite vector spaces: asymptotic normality and Mahonian statistics
• Longest alternating subsequences of \(k\)-ary words
• Normal approximation for nonlinear statistics using a concentration inequality approach
• Normal approximations for descents and inversions of permutations of multisets
• Normal Approximation by Stein’s Method
• Shuffling Cards and Stopping Times
• Analysis of Top To Random Shuffles
• A Class of Statistics with Asymptotically Normal Distribution

This page was built for publication: Descent-inversion statistics in riffle shuffles