On a problem in shuffling
type: Item
instance of: scholarly article
title: On a problem in shuffling
zbMATH Open document ID: 0956.05004
author: Noga Alon
author: Ken Berman
author: Daniel J. Kleitman
published in: Journal of Combinatorial Theory. Series A
publication date: 2001-03-04T00:00:00Z
review text: 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.
reviewed by: Péter Komjáth
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 1525300
zbMATH Keywords: permutations
MaRDI profile type: Publication
OpenAlex ID: W2021126179
DOI: 10.1006/JCTA.2000.3087
description: scientific article; zbMATH DE number 1525300