What is the Perfect Shuffle

James Enouen
{"title":"What is the Perfect Shuffle","authors":"James Enouen","doi":"10.1090/spec/022/01","DOIUrl":null,"url":null,"abstract":"When shuffling a deck of cards, one probably wants to make sure it is thoroughly shuffled. A way to do this is by sifting through the cards to ensure that no adjacent cards are the same number, because surely this is a poorly shuffled deck. Unfortunately, human intuition for probability tends to lead us astray. For a standard 52-card deck of playing cards, the event is actually extremely likely. This report will attempt to elucidate how to answer this surprisingly difficult combinatorial question directly using rook polynomials.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"8 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/spec/022/01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When shuffling a deck of cards, one probably wants to make sure it is thoroughly shuffled. A way to do this is by sifting through the cards to ensure that no adjacent cards are the same number, because surely this is a poorly shuffled deck. Unfortunately, human intuition for probability tends to lead us astray. For a standard 52-card deck of playing cards, the event is actually extremely likely. This report will attempt to elucidate how to answer this surprisingly difficult combinatorial question directly using rook polynomials.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
什么是完美洗牌
当洗牌时,人们可能想要确保它被彻底洗牌。这样做的一种方法是通过筛选卡片,以确保相邻的卡片没有相同的数字,因为这肯定是一个糟糕的洗牌组。不幸的是,人类对概率的直觉往往会把我们引入歧途。对于一副标准的52张扑克牌,这种情况实际上是极有可能发生的。本报告将试图阐明如何直接使用车多项式来回答这个令人惊讶的困难组合问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Schubert Products for Permutations with Separated Descents. Explicit Formulas for the First Form (q,r)-Dowling Numbers and (q,r)-Whitney-Lah Numbers Tit-for-Tat Strategy as a Deformed Zero-Determinant Strategy in Repeated Games An inequality for coefficients of the real-rooted polynomials $\lambda$-Core Distance Partitions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1