On a problem in shuffling

Noga Alon; Ken Berman; Daniel Kleitman

doi:10.1006/jcta.2000.3087

On a problem in shuffling

Noga Alon, Ken Berman, Daniel Kleitman

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Upper and lower bounds are obtained for the number of shuffles necessary to reach the "furthest" two hand deal starting from a given permutation of a deck of cards. The bounds are on the order of (log₂n)/2 and loglogn, respectively.

Original language	English (US)
Pages (from-to)	5-14
Number of pages	10
Journal	Journal of Combinatorial Theory. Series A
Volume	91
Issue number	1-2
DOIs	https://doi.org/10.1006/jcta.2000.3087
State	Published - Jul 2000
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1006/jcta.2000.3087

Cite this

@article{e15792a6cfa244f78bf3483c402702f5,

title = "On a problem in shuffling",

abstract = "Upper and lower bounds are obtained for the number of shuffles necessary to reach the {"}furthest{"} two hand deal starting from a given permutation of a deck of cards. The bounds are on the order of (log2n)/2 and loglogn, respectively.",

author = "Noga Alon and Ken Berman and Daniel Kleitman",

note = "Funding Information: 1Supported in part by a US-Israel BSF grant. 2Supported in part by NSA grant and a US-Israel BSF grant.",

year = "2000",

month = jul,

doi = "10.1006/jcta.2000.3087",

language = "English (US)",

volume = "91",

pages = "5--14",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "1-2",

}

TY - JOUR

T1 - On a problem in shuffling

AU - Alon, Noga

AU - Berman, Ken

AU - Kleitman, Daniel

N1 - Funding Information: 1Supported in part by a US-Israel BSF grant. 2Supported in part by NSA grant and a US-Israel BSF grant.

PY - 2000/7

Y1 - 2000/7

N2 - Upper and lower bounds are obtained for the number of shuffles necessary to reach the "furthest" two hand deal starting from a given permutation of a deck of cards. The bounds are on the order of (log2n)/2 and loglogn, respectively.

AB - Upper and lower bounds are obtained for the number of shuffles necessary to reach the "furthest" two hand deal starting from a given permutation of a deck of cards. The bounds are on the order of (log2n)/2 and loglogn, respectively.

UR - http://www.scopus.com/inward/record.url?scp=0034215738&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034215738&partnerID=8YFLogxK

U2 - 10.1006/jcta.2000.3087

DO - 10.1006/jcta.2000.3087

M3 - Article

AN - SCOPUS:0034215738

SN - 0097-3165

VL - 91

SP - 5

EP - 14

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 1-2

ER -

On a problem in shuffling

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this