On a problem in shuffling
The number of shuffles, needed to apply on \(n\) cards, to achieve all sets of 2 hands, is estimated. In this beautifully written paper \(\frac{1}{2}\log n\) and \(\log \log n\) are given as upper and lower bounds.
scientific article; zbMATH DE number 1525300