PreprintCC BY 4.0arXiv
Clean handshake sequences
Abstract
After a basketball game, each of the n players on Team A must shake hands with each of the n players on Team B. What is the minimum number of (reversible, ambidextrous) gloves required so that zero germ transmission occurs? We show that the answer is 3n/2+o(n) and develop a general theory for prescribed handshake sets.
Related
- On strongly m-Δ-clean ring
- On the Regularity and Clean Properties of Matrices over Dual Numbers
- CleanRM: Reward Modeling from Noisy Feedback with a Few Clean Feedback for RLHF
- Multiscale Nonlinear Risk Transmission in the Carbon–Fossil Energy–Clean Energy System from a Fractal-Market Perspective: Evidence from EMD–TVP-VAR and Interpretable Machine Learning
- When Clean Data Hurts: Learning with Monotone Corruptions Beyond Binary Classification
BibTeX
@misc{byrne2026clean,
title = {{Clean handshake sequences}},
author = {John Byrne and Colby Sherwood and Brian Wilmarth},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.17602},
eprint = {2610.17602},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.17602},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Clean handshake sequences
AU - John Byrne
AU - Colby Sherwood
AU - Brian Wilmarth
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2610.17602
UR - https://arxiv.org/abs/2610.17602
AB - After a basketball game, each of the n players on Team A must shake hands with each of the n players on Team B. What is the minimum number of (reversible, ambidextrous) gloves required so that zero germ transmission occurs? We show that the answer is 3n/2+o(n) and develop a general theory for prescribed handshake sets.
ER -