{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T00:22:49Z","timestamp":1716250969091},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T00:00:00Z","timestamp":1708473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T00:00:00Z","timestamp":1708473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00493-024-00083-6","type":"journal-article","created":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T21:06:04Z","timestamp":1708549564000},"page":"531-561","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Ungar Games"],"prefix":"10.1007","volume":"44","author":[{"given":"Colin","family":"Defant","sequence":"first","affiliation":[]},{"given":"Noah","family":"Kravitz","sequence":"additional","affiliation":[]},{"given":"Nathan","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,21]]},"reference":[{"key":"83_CR1","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1080\/00029890.1974.11993683","volume":"81","author":"D Gale","year":"1974","unstructured":"Gale, D.: A curious Nim-type game. Amer. Math. Monthly 81, 876\u2013879 (1974)","journal-title":"Amer. Math. Monthly"},{"key":"83_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1006\/aama.2000.0714","volume":"26","author":"D Zeilberger","year":"2001","unstructured":"Zeilberger, D.: Three-rowed CHOMP. Adv. Appl. Math. 26, 168\u2013179 (2001)","journal-title":"Adv. Appl. Math."},{"key":"83_CR3","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1080\/00029890.1970.11992527","volume":"77","author":"PR Scott","year":"1970","unstructured":"Scott, P.R.: On the sets of directions determined by $$n$$ points. Amer. Math. Monthly 77, 502\u2013505 (1970)","journal-title":"Amer. Math. Monthly"},{"key":"83_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0097-3165(82)90045-0","volume":"33","author":"P Ungar","year":"1982","unstructured":"Ungar, P.: $$2N$$ noncollinear points determine at least $$2N$$ directions. J. Combin. Theory Ser. A 33, 343\u2013347 (1982)","journal-title":"J. Combin. Theory Ser. A"},{"key":"83_CR5","first-page":"383","volume":"32","author":"JE Goodman","year":"1981","unstructured":"Goodman, J.E., Pollack, R.: A combinatorial perspective on some problems in geometry. Congr. Numer. 32, 383\u2013394 (1981)","journal-title":"Congr. Numer."},{"key":"83_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/23-EJP1056","volume":"28","author":"C Defant","year":"2023","unstructured":"Defant, C., Li, R.: Ungarian Markov chains. Electron. J. Probab. 28, 1\u201339 (2023)","journal-title":"Electron. J. Probab."},{"key":"83_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44205-0","volume-title":"Proofs from the book","author":"M Aigner","year":"2014","unstructured":"Aigner, M., Ziegler, G.M.: Proofs from the book, 5th edn. Springer-Verlag, Germany (2014)","edition":"5"},{"key":"83_CR8","doi-asserted-by":"crossref","unstructured":"Asinowski, A., Banderier, C., Hackl, B.: Flip-sort and combinatorial aspects of pop-stack sorting. Discrete Math. Theor. Comput. Sci., 22 (2021)","DOI":"10.46298\/dmtcs.6196"},{"key":"83_CR9","first-page":"395","volume":"88","author":"A Asinowski","year":"2019","unstructured":"Asinowski, A., Banderier, C., Billey, S., Hackl, B., Linusson, S.: Pop-stack sorting and its image: permutations with overlapping runs. Acta. Math. Univ. Comenian. 88, 395\u2013402 (2019)","journal-title":"Acta. Math. Univ. Comenian."},{"key":"83_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.aam.2019.04.002","volume":"108","author":"A Claesson","year":"2019","unstructured":"Claesson, A., Gu\u00f0mundsson, B.\u00c1.: Enumerating permutations sortable by $$k$$ passes through a pop-stack. Adv. Appl. Math. 108, 79\u201396 (2019)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"83_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1080\/10586458.2021.1926001","volume":"32","author":"A Claesson","year":"2021","unstructured":"Claesson, A., Gu\u00f0mundsson, B.\u00c1., Pantone, J.: Counting pop-stacked permutations in polynomial time. Exp. Math. 32(1), 97\u2013104 (2021)","journal-title":"Exp. Math."},{"key":"83_CR12","unstructured":"Lichev, L.: Lower bound on the running time of pop-stack sorting on a random permutation. arXiv:2212.09316 [v1]"},{"key":"83_CR13","first-page":"179","volume":"74","author":"L Pudwell","year":"2019","unstructured":"Pudwell, L., Smith, R.: Two-stack-sorting with pop stacks. Australas. J. Combin. 74, 179\u2013195 (2019)","journal-title":"Australas. J. Combin."},{"key":"83_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2023.102649","volume":"154","author":"Y Choi","year":"2024","unstructured":"Choi, Y., Sun, N.: The image of the Pop operator on various lattices. Adv. Appl. Math. 154, 102649 (2024)","journal-title":"Adv. Appl. Math."},{"key":"83_CR15","doi-asserted-by":"crossref","unstructured":"Defant, C.: Pop-stack-sorting for Coxeter groups. Comb. Theory, 2 (2022)","DOI":"10.5070\/C62359167"},{"key":"83_CR16","doi-asserted-by":"crossref","unstructured":"Defant, C.: Meeting covered elements in $$\\nu $$-Tamari lattices. Adv. Appl. Math., 134 (2022)","DOI":"10.1016\/j.aam.2021.102303"},{"key":"83_CR17","doi-asserted-by":"crossref","unstructured":"Defant, C., Williams, N.: Semidistrim lattices. Forum Math. Sigma, 11 (2023)","DOI":"10.1017\/fms.2023.46"},{"key":"83_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2022.102362","volume":"139","author":"L Hong","year":"2022","unstructured":"Hong, L.: The pop-stack-sorting operator on Tamari lattices. Adv. Appl. Math. 139, 102362 (2022)","journal-title":"Adv. Appl. Math."},{"key":"83_CR19","unstructured":"Sapounakis, A., Tasoulas, I., Tsikouras, P.: On the dominance partial ordering on Dyck paths. J. Integer Seq., 9 (2006)"},{"key":"83_CR20","first-page":"131","volume":"10","author":"D Tamari","year":"1962","unstructured":"Tamari, D.: The algebra of bracketings and their enumeration. Nieuw Archief voor Wiskunde 10, 131\u2013146 (1962)","journal-title":"Nieuw Archief voor Wiskunde"},{"key":"83_CR21","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Hoissen, F., Pallo, J. M., Stasheff, J.: Associahedra, Tamari lattices and related structures: Tamari memorial festschrift, vol. 299 of Progress in Mathematics. Birkh\u00e4user (2012)","DOI":"10.1007\/978-3-0348-0405-9"},{"key":"83_CR22","volume-title":"Enumerative combinatorics","author":"RP Stanley","year":"2012","unstructured":"Stanley, R.P.: Enumerative combinatorics, vol. 1, 2nd edn. Cambridge University Press, Cambridge (2012)","edition":"2"},{"key":"83_CR23","unstructured":"OEIS Foundation Inc. Entry A113228 in The On-Line Encyclopedia of Integer Sequences, http:\/\/oeis.org\/A113228 (2023)"},{"key":"83_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"83_CR25","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.aim.2005.07.010","volume":"205","author":"N Reading","year":"2006","unstructured":"Reading, N.: Cambrian lattices. Adv. Math. 205, 313\u2013353 (2006)","journal-title":"Adv. Math."},{"key":"83_CR26","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/BF01247093","volume":"41","author":"SV Fomin","year":"1988","unstructured":"Fomin, S.V.: Generalized Robinson-Schensted-Knuth correspondence. J. Soviet Math. 41, 979\u2013991 (1988)","journal-title":"J. Soviet Math."},{"key":"83_CR27","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1090\/S0894-0347-1988-0941434-9","volume":"1","author":"RP Stanley","year":"1988","unstructured":"Stanley, R.P.: Differential posets. J. Amer. Math. Soc. 1, 919\u2013961 (1988)","journal-title":"J. Amer. Math. Soc."},{"key":"83_CR28","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D Barrington","year":"1990","unstructured":"Barrington, D., Immerman, N., Straubing, H.: On uniformity within $${ N}{ C}^{1}$$. J. Comput. System Sci. 41, 274\u2013306 (1990)","journal-title":"J. Comput. System Sci."},{"key":"83_CR29","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ipl.2011.09.016","volume":"112","author":"AO Kalinich","year":"2012","unstructured":"Kalinich, A.O.: Flipping the winner of a poset game. Inform. Process. Lett. 112, 86\u201389 (2012)","journal-title":"Inform. Process. Lett."},{"key":"83_CR30","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"TJ Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. System Sci. 16, 185\u2013225 (1978)","journal-title":"J. Comput. System Sci."},{"key":"83_CR31","doi-asserted-by":"crossref","unstructured":"Grier, D.: Deciding the winner of an arbitrary finite poset game is PSPACE-complete. Automata, Languages, and Programming: 40th International Colloquium, ICALP Proceedings 497\u2013503 (2013)","DOI":"10.1007\/978-3-642-39206-1_42"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00083-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00083-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00083-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T10:07:18Z","timestamp":1716199638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00083-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,21]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00083-6","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,21]]},"assertion":[{"value":"23 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}