{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:15:59Z","timestamp":1760573759350,"version":"build-2065373602"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>If taken seriously, the advice in the title leads to interesting combinatorics. Consider <jats:italic>N<\/jats:italic>\u00a0people moving between <jats:italic>M<\/jats:italic>\u00a0rooms as follows: at each step, simultaneously, the smartest person in each room moves to a different room of their choice, while no one else moves. The process repeats. In this paper we determine which configurations are reachable, from which other configurations, and provide bounds on the number of moves. Namely, let\u00a0<jats:italic>G<\/jats:italic>(<jats:italic>N<\/jats:italic>,\u00a0<jats:italic>M<\/jats:italic>) be the directed graph with vertices representing all\u00a0<jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$M^N$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>M<\/mml:mi>\n                    <mml:mi>N<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> configurations and edges representing possible moves. We prove that the graph\u00a0<jats:italic>G<\/jats:italic>(<jats:italic>N<\/jats:italic>,\u00a0<jats:italic>M<\/jats:italic>) is weakly connected, and that it is strongly connected if and only if\u00a0<jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$M\\ge N+1$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>M<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mi>N<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> (one extra room for maneuvering is both required and sufficient). For\u00a0<jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$M\\le N$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>M<\/mml:mi>\n                    <mml:mo>\u2264<\/mml:mo>\n                    <mml:mi>N<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>, we show that the graph has a giant strongly connected component with\u00a0<jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\Theta (M^N)$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u0398<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msup>\n                      <mml:mi>M<\/mml:mi>\n                      <mml:mi>N<\/mml:mi>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> vertices and diameter\u00a0<jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathcal {O}(N^2)$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msup>\n                      <mml:mi>N<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msup>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00373-025-02963-0","type":"journal-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T17:57:50Z","timestamp":1758304670000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["If You are the Smartest Person in the Room, You are in the Wrong Room"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0806-2591","authenticated-orcid":false,"given":"Davide","family":"Sclosa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,19]]},"reference":[{"key":"2963_CR1","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1214\/aop\/1176991158","volume":"17","author":"JT Cox","year":"1989","unstructured":"Cox, J.T.: Coalescing random walks and voter model consensus times on the torus in $${\\mathbb{Z} }^d$$. Ann. Prob. 17, 1333\u20131366 (1989)","journal-title":"Ann. Prob."},{"issue":"6","key":"2963_CR2","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1080\/00029890.1985.11971635","volume":"92","author":"P Cull","year":"1985","unstructured":"Cull, P., Ecklund, E.F.: Towers of Hanoi and analysis of algorithms. Am. Math. Mon. 92(6), 407\u2013420 (1985)","journal-title":"Am. Math. Mon."},{"key":"2963_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation Groups","author":"JD Dixon","year":"1996","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups, vol. 163. Springer Science & Business Media, Cham (1996)"},{"issue":"1","key":"2963_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1215\/S0012-7094-62-02918-6","volume":"29","author":"DH Husemoller","year":"1962","unstructured":"Husemoller, D.H.: Ramified coverings of Riemann Surfaces. Duke Math. J. 29(1), 167\u2013174 (1962)","journal-title":"Duke Math. J."},{"key":"2963_CR5","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Winkler, P.: Mixing of random walks and other diffusions on a graph. In: London Mathematical Society Lecture Note Series, pp. 119\u2013154 (1995)","DOI":"10.1017\/CBO9780511662096.007"},{"issue":"3","key":"2963_CR6","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1137\/050628660","volume":"20","author":"D Romik","year":"2006","unstructured":"Romik, D.: Shortest paths in the tower of Hanoi graph and finite automata. SIAM J. Discret. Math. 20(3), 610\u2013622 (2006)","journal-title":"SIAM J. Discret. Math."},{"issue":"2\u20133","key":"2963_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(81)90224-7","volume":"37","author":"RP Stanley","year":"1981","unstructured":"Stanley, R.P.: Factorization of permutations into $$n$$-cycles. Discret. Math. 37(2\u20133), 255\u2013262 (1981)","journal-title":"Discret. Math."},{"issue":"7","key":"2963_CR8","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1016\/j.ejc.2012.03.026","volume":"33","author":"Z \u0160uni\u0107","year":"2012","unstructured":"\u0160uni\u0107, Z.: Twin towers of Hanoi. Eur. J. Comb. 33(7), 1691\u20131707 (2012)","journal-title":"Eur. J. Comb."},{"key":"2963_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755149","volume-title":"Additive Combinatorics","author":"T Tao","year":"2006","unstructured":"Tao, T., Vu, V.H.: Additive Combinatorics, vol. 105. Cambridge University Press, Cambridge (2006)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02963-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02963-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02963-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:34Z","timestamp":1760505094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02963-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,19]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2963"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02963-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,9,19]]},"assertion":[{"value":"15 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"105"}}