<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The overhand shuffle mixes in $Θ(n^2\log n)$ steps · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0501401/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/math_0501401/feed.xml" rel="self" type="application/rss+xml" /><item><title>The overhand shuffle mixes in $Θ(n^2\log n)$ steps — mentioned by strogonoff</title><link>https://news.ycombinator.com/item?id=24070634</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0501401:24070634</guid><pubDate>Thu, 06 Aug 2020 13:24:21 GMT</pubDate><description>&lt;p&gt;&amp;gt; You need about 10000 (ten thousand) of them to shuffle an ordinary deck of 52 cards. My source[0] says the lower bound for full overhand shuffle is number of cards squared, so less than 3000 shuffles for 52 cards. Upper bound around 5000. Your source? [0] https://arxiv.org/abs/math/0501401&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0501401/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.PR</category></item></channel></rss>
