{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:33:57Z","timestamp":1740144837650,"version":"3.37.3"},"reference-count":45,"publisher":"Informa UK Limited","issue":"1","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["The American Mathematical Monthly"],"published-print":{"date-parts":[[2021,1,2]]},"DOI":"10.1080\/00029890.2021.1835384","type":"journal-article","created":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T10:00:46Z","timestamp":1610704846000},"page":"4-24","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["Containing All Permutations"],"prefix":"10.1080","volume":"128","author":[{"given":"Michael","family":"Engen","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Florida, Gainesville, FL 32611"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Vatter","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Florida, Gainesville, FL 32611"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2021,1,15]]},"reference":[{"doi-asserted-by":"publisher","key":"CIT0001","DOI":"10.1016\/0012-365X(74)90116-2"},{"doi-asserted-by":"publisher","key":"CIT0002","DOI":"10.37236\/7386"},{"key":"CIT0003","first-page":"39","author":"Albert M.","year":"2009","journal-title":"Discrete Math. Theor. Comput. Sci. Proc"},{"doi-asserted-by":"publisher","key":"CIT0004","DOI":"10.37236\/1477"},{"key":"CIT0005","first-page":"91","volume":"93","author":"Ashlock D.","year":"1993","journal-title":"Congr. Numer."},{"doi-asserted-by":"publisher","key":"CIT0006","DOI":"10.7155\/jgaa.00318"},{"doi-asserted-by":"publisher","key":"CIT0007","DOI":"10.1201\/b12210"},{"doi-asserted-by":"publisher","key":"CIT0008","DOI":"10.1016\/0012-365X(92)90699-G"},{"doi-asserted-by":"crossref","unstructured":"Chroman, Z., Kwan, M., Singhal, M. (2020). Lower bounds for superpatterns an universal sequences. arxiv.org\/abs\/2004.02375","key":"CIT0009","DOI":"10.1016\/j.jcta.2021.105467"},{"volume-title":"Selected combinatorial research problems. Technical Report STAN-CS-72-292","year":"1972","author":"Chv\u00e1tal V.","key":"CIT0010"},{"unstructured":"de Bruijn, N. (1975). Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n  zeros and ones that show each n-letter word exactly once. Technical Report T.H.Report 75-WSK-06. Technische Hogeschool Eindhoven Nederland. pure.tue.nl\/ws\/files\/1875614\/252901.pdf","key":"CIT0011"},{"volume-title":"Magical Mathematics: The Mathematical Ideas That Animate Great Magic Tricks","year":"2012","author":"Diaconis P.","key":"CIT0012"},{"volume-title":"Permutation City","year":"1994","author":"Egan G.","key":"CIT0013"},{"unstructured":"Egan, G. (2018). Superpermutations. gregegan.net\/SCIENCE\/Superpermutations\/Superpermutations.html","key":"CIT0014"},{"doi-asserted-by":"publisher","key":"CIT0015","DOI":"10.1007\/s00026-007-0329-7"},{"doi-asserted-by":"publisher","key":"CIT0016","DOI":"10.1137\/0130040"},{"doi-asserted-by":"publisher","key":"CIT0017","DOI":"10.1007\/s00373-014-1429-x"},{"unstructured":"Griggs, M. (2018). An anonymous 4chan post could help solve a 25-year-old math mystery. The Verge, October 24. theverge.com\/2018\/10\/24\/18019464\/4chan-anon-anime-haruhi-math-mystery","key":"CIT0018"},{"doi-asserted-by":"publisher","key":"CIT0019","DOI":"10.1007\/BFb0092270"},{"doi-asserted-by":"publisher","key":"CIT0020","DOI":"10.1007\/978-0-387-26677-0"},{"doi-asserted-by":"publisher","key":"CIT0021","DOI":"10.1007\/978-3-642-14031-0_33"},{"doi-asserted-by":"publisher","key":"CIT0022","DOI":"10.1007\/s00453-011-9544-z"},{"unstructured":"Honner, P. (2019). Unscrambling the hidden secrets of superpermutations. Quanta Mag., January 16. quantamagazine.org\/unscrambling-the-hidden-secrets-of-superpermutations-20190116\/","key":"CIT0023"},{"unstructured":"Houston, R. (2014). Tackling the minimal superpermutation problem. arxiv.org\/abs\/1408.5108","key":"CIT0024"},{"doi-asserted-by":"publisher","key":"CIT0025","DOI":"10.1016\/0012-365X(93)90330-V"},{"doi-asserted-by":"publisher","key":"CIT0026","DOI":"10.1016\/j.disc.2007.11.004"},{"unstructured":"Johnston, N. (2013). The minimal superpermutation problem. April 10. njohnston.ca\/2013\/04\/the-minimal-superpermutation-problem\/","key":"CIT0027"},{"doi-asserted-by":"publisher","key":"CIT0028","DOI":"10.1016\/j.disc.2013.03.024"},{"unstructured":"Johnston, N. (2014). All minimal superpermutations on five symbols have been found. August 13. njohnston.ca\/2014\/08\/all-minimal-superpermutations-on-five-symbols-have-been-found\/","key":"CIT0029"},{"unstructured":"Klarreich, E. (2018). Mystery math whiz and novelist advance permutation problem. Quanta Mag., November 5. quantamagazine.org\/sci-fi-writer-greg-egan-and-anonymous-math-whiz-advance-permutation-problem-20181105\/","key":"CIT0030"},{"doi-asserted-by":"publisher","key":"CIT0031","DOI":"10.1016\/0097-3165(76)90057-1"},{"unstructured":"Knuth, D. (2011). The Art of Computer Programming, Vol. 4A. Upper Saddle River, NJ: Addison-Wesley.","key":"CIT0032"},{"doi-asserted-by":"publisher","key":"CIT0033","DOI":"10.1016\/0012-365X(75)90004-7"},{"doi-asserted-by":"publisher","key":"CIT0034","DOI":"10.1016\/j.disc.2011.12.027"},{"doi-asserted-by":"publisher","key":"CIT0035","DOI":"10.1016\/j.jcta.2008.04.007"},{"doi-asserted-by":"publisher","key":"CIT0036","DOI":"10.1016\/0012-365X(80)90177-6"},{"volume-title":"Notes on a problem involving permutations as subsequences. Technical Report STAN-CS-73-340","year":"1973","author":"Newey M. C.","key":"CIT0037"},{"volume-title":"Combinatorial Algorithms","year":"1975","author":"Nijenhuis A.","key":"CIT0038"},{"unstructured":"Parker, M. (2019). Superpermutations: the maths problem solved by 4chan. YouTube, January 28. youtube.com\/watch?v=OZzIvl1tbPo","key":"CIT0039"},{"doi-asserted-by":"publisher","key":"CIT0040","DOI":"10.37236\/2859"},{"doi-asserted-by":"publisher","key":"CIT0041","DOI":"10.1145\/1798596.1798598"},{"doi-asserted-by":"publisher","key":"CIT0042","DOI":"10.1137\/1.9781611975031.37"},{"doi-asserted-by":"publisher","key":"CIT0043","DOI":"10.1016\/S0195-6698(85)80052-4"},{"unstructured":"Williams, A. (2013). Hamiltonicity of the Cayley digraph on the symmetric group generated by \u03c3=(12\u22efn)  and \u03c4=(12) . arxiv.org\/abs\/1307.2549","key":"CIT0044"},{"doi-asserted-by":"publisher","key":"CIT0045","DOI":"10.1016\/j.ipl.2011.03.018"}],"container-title":["The American Mathematical Monthly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00029890.2021.1835384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:59:26Z","timestamp":1621904366000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00029890.2021.1835384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1,2]]}},"alternative-id":["10.1080\/00029890.2021.1835384"],"URL":"https:\/\/doi.org\/10.1080\/00029890.2021.1835384","relation":{},"ISSN":["0002-9890","1930-0972"],"issn-type":[{"type":"print","value":"0002-9890"},{"type":"electronic","value":"1930-0972"}],"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uamm20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uamm20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-05-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-18","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}