A path formula for the sock sorting problem

DOI10.1137/S0040585X97T99068XMaRDI QIDQ5034427zbMATH OpenOpenAlexFDO

Authors S. Korbel, Peter Mörters

Publication date 25 February 2022

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.08113

zbMATH Keywords

Daniel Bernoulli's matching problemsorting of socks

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17)

Abstract: Suppose $n$ different pairs of socks are put in a tumble dryer. When the dryer is finished socks are taken out one by one, if a sock matches one of the socks on the sorting table both are removed, otherwise it is put on the table until its partner emerges from the dryer. We note the number of socks on the table after each of the $2n$ socks is taken from the dryer and give an explicit formula for the probability that this sequence equals a given sequence of length $2n$.

Recommendations

• A brief overview of the sock matching problem.
• The sock matching problem
• The Sock Problem Revisited
• scientific article; zbMATH DE number 1149769
• On the random sampling of pairs, with Pedestrian examples

Cites work

• A brief overview of the sock matching problem.
• Fluctuation bounds for sock-sorting and other stochastic processes
• scientific article; zbMATH DE number 1149769 (Why is no real title available?)
• Random time changes for sock-sorting and other stochastic process limit theorems
• The sock matching problem

Cited in

(7)

• Deranged socks
• The sock matching problem
• scientific article; zbMATH DE number 1149769 (Why is no real title available?)
• The Sock Problem Revisited
• A brief overview of the sock matching problem.
• On the random sampling of pairs, with Pedestrian examples
• Foot-sorting for socks

This page was built for publication: A path formula for the sock sorting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034427)