{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:25:40Z","timestamp":1757615140616,"version":"3.44.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"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":[[2025,8]]},"DOI":"10.1007\/s00493-025-00167-x","type":"journal-article","created":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T14:22:54Z","timestamp":1753280574000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Approximate Counting Version of the Multidimensional Szemer\u00e9di Theorem"],"prefix":"10.1007","volume":"45","author":[{"given":"Natalie","family":"Behague","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Hyde","sequence":"additional","affiliation":[]},{"given":"Natasha","family":"Morrison","sequence":"additional","affiliation":[]},{"given":"Jonathan A.","family":"Noel","sequence":"additional","affiliation":[]},{"given":"Ashna","family":"Wright","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,23]]},"reference":[{"key":"167_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.jcta.2015.01.003","volume":"132","author":"J Balogh","year":"2015","unstructured":"Balogh, J., Das, S., Delcourt, M., Liu, H., Sharifzadeh, M.: Intersecting families of discrete structures are typically trivial. J. Combin. Theory Ser. A 132, 224\u2013245 (2015)","journal-title":"J. Combin. Theory Ser. A"},{"key":"167_CR2","first-page":"6168","volume":"20","author":"J Balogh","year":"2017","unstructured":"Balogh, J., Liu, H., Sharifzadeh, M.: The number of subsets of integers with no k-term arithmetic progression. Int. Math. Res. Not. IMRN, 20, 6168\u20136186 (2017)","journal-title":"Int. Math. Res. Not. IMRN,"},{"issue":"3","key":"167_CR3","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1090\/S0894-0347-2014-00816-X","volume":"28","author":"J Balogh","year":"2015","unstructured":"Balogh, J., Morris, R., Samotij, W.: Independent sets in hypergraphs. J. Amer. Math. Soc. 28(3), 669\u2013709 (2015)","journal-title":"J. Amer. Math. Soc."},{"key":"167_CR4","doi-asserted-by":"crossref","unstructured":"Balogh, J., Morris, R., Samotij, W.: The method of hypergraph containers, Proceedings of the International Congress of Mathematicians\u2014Rio de Janeiro 2018. Vol. IV. Invited lectures, World Sci. Publ., Hackensack, NJ, pp.\u00a03059\u20133092 (2018)","DOI":"10.1142\/9789813272880_0172"},{"key":"167_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1073\/pnas.32.12.331","volume":"32","author":"FA Behrend","year":"1946","unstructured":"Behrend, F.A.: On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. U.S.A. 32, 331\u2013332 (1946)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"167_CR6","doi-asserted-by":"crossref","unstructured":"Bloom, T.F.: A quantitative improvement for Roth\u2019s theorem on arithmetic progressions. J. Lond. Math. Soc.(2) 93(3), 643\u2013663 (2016)","DOI":"10.1112\/jlms\/jdw010"},{"key":"167_CR7","unstructured":"Bloom, T.\u00a0F., Sisask, O.: Logarithmic bounds for Roth\u2019s theorem via almost-periodicity, Discrete Anal. Paper No. 4, 20 (2019)"},{"key":"167_CR8","unstructured":"Bloom, T.\u00a0F., Sisask, O.: Breaking the logarithmic barrier in Roth\u2019s theorem on arithmetic progressions, (2021), E-print arXiv:2007.03528v2"},{"key":"167_CR9","first-page":"61","volume":"1990","author":"PJ Cameron","year":"1988","unstructured":"Cameron, P.J., Erd\u0151s, P.: On the number of sets of integers with various properties, Number theory (Banff, AB,: de Gruyter. Berlin 1990, 61\u201379 (1988)","journal-title":"Berlin"},{"issue":"5","key":"167_CR10","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1017\/S0963548323000111","volume":"32","author":"D Dong","year":"2023","unstructured":"Dong, D., Mani, N., Zhao, Y.: On the number of error correcting codes. Combin. Probab. Comput. 32(5), 819\u2013832 (2023)","journal-title":"Combin. Probab. Comput."},{"key":"167_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11856-011-0061-1","volume":"184","author":"M Elkin","year":"2011","unstructured":"Elkin, M.: An improved construction of progression-free sets. Israel J. Math. 184, 93\u2013128 (2011)","journal-title":"Israel J. Math."},{"issue":"4","key":"167_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1112\/jlms\/s1-11.4.261","volume":"11","author":"P Erd\u0151s","year":"1936","unstructured":"Erd\u0151s, P., Tur\u00e1n, P.: On some sequences of integers. J. London Math. Soc. 11(4), 261\u2013264 (1936)","journal-title":"J. London Math. Soc."},{"key":"167_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BF02813304","volume":"31","author":"H Furstenberg","year":"1977","unstructured":"Furstenberg, H.: Ergodic behavior of diagonal measures and a theorem of Szemer\u00e9di on arithmetic progressions. J. Analyse Math. 31, 204\u2013256 (1977)","journal-title":"J. Analyse Math."},{"issue":"1978","key":"167_CR14","first-page":"275","volume":"34","author":"H Furstenberg","year":"1979","unstructured":"Furstenberg, H., Katznelson, Y.: An ergodic Szemer\u00e9di theorem for commuting transformations. J. Analyse Math. 34(1978), 275\u2013291 (1979)","journal-title":"J. Analyse Math."},{"key":"167_CR15","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF03041066","volume":"57","author":"H Furstenberg","year":"1991","unstructured":"Furstenberg, H., Katznelson, Y.: A density version of the Hales-Jewett theorem. J. Anal. Math. 57, 64\u2013119 (1991)","journal-title":"J. Anal. Math."},{"issue":"3","key":"167_CR16","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00039-001-0332-9","volume":"11","author":"WT Gowers","year":"2001","unstructured":"Gowers, W.T.: A new proof of Szemer\u00e9di\u2019s theorem. Geom. Funct. Anal. 11(3), 465\u2013588 (2001)","journal-title":"Geom. Funct. Anal."},{"key":"167_CR17","doi-asserted-by":"crossref","unstructured":"Gowers, W.T.: Hypergraph regularity and the multidimensional Szemer\u00e9di theorem. Ann. of Math. (2) 166(3), 897\u2013946 (2007)","DOI":"10.4007\/annals.2007.166.897"},{"key":"167_CR18","first-page":"141","volume-title":"A note on Elkin\u2019s improvement of Behrend\u2019s construction","author":"B Green","year":"2010","unstructured":"Green, B., Wolf, J.: A note on Elkin\u2019s improvement of Behrend\u2019s construction, pp. 141\u2013144. Springer, New York, Additive number theory (2010)"},{"key":"167_CR19","doi-asserted-by":"crossref","unstructured":"Kelley, Z., Meka, R.: Strong bounds for 3-progressions, (2023) E-print arXiv:2302.05537v4","DOI":"10.1109\/FOCS57990.2023.00059"},{"issue":"2","key":"167_CR20","doi-asserted-by":"publisher","first-page":"2.53,19","DOI":"10.37236\/9424","volume":"29","author":"Y Kim","year":"2022","unstructured":"Kim, Y.: The number of k-dimensional corner-free subsets of grids. Electron. J. Combin. 29(2), 2.53,19 (2022)","journal-title":"Electron. J. Combin."},{"key":"167_CR21","first-page":"677","volume":"21","author":"D Kleitman","year":"1969","unstructured":"Kleitman, D.: On Dedekind\u2019s problem: The number of monotone Boolean functions. Proc. Amer. Math. Soc. 21, 677\u2013682 (1969)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"2","key":"167_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/rsa.20117","volume":"28","author":"B Nagle","year":"2006","unstructured":"Nagle, B., R\u00f6dl, V., Schacht, M.: The counting lemma for regular k-uniform hypergraphs. Random Structures Algorithms 28(2), 113\u2013179 (2006)","journal-title":"Random Structures Algorithms"},{"key":"167_CR23","doi-asserted-by":"crossref","unstructured":"O\u2019Bryant, K.: Sets of integers that do not contain long arithmetic progressions, Electron. J. Combin. 18, no.\u00a01, Paper 59, 15 (2011)","DOI":"10.37236\/546"},{"key":"167_CR24","doi-asserted-by":"crossref","unstructured":"Rankin, R.\u00a0A.: Sets of integers containing not more than a given number of terms in arithmetical progression, Proc. Roy. Soc. Edinburgh Sect. A 65 (1960\/61), 332\u2013344 (1960\/61)","DOI":"10.1017\/S0080454100017726"},{"issue":"1","key":"167_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20017","volume":"25","author":"V R\u00f6dl","year":"2004","unstructured":"R\u00f6dl, V., Skokan, J.: Regularity lemma for k-uniform hypergraphs. Random Structures Algorithms 25(1), 1\u201342 (2004)","journal-title":"Random Structures Algorithms"},{"key":"167_CR26","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1112\/jlms\/s1-28.1.104","volume":"28","author":"KF Roth","year":"1953","unstructured":"Roth, K.F.: On certain sets of integers. J. London Math. Soc. 28, 104\u2013109 (1953)","journal-title":"J. London Math. Soc."},{"key":"167_CR27","doi-asserted-by":"crossref","unstructured":"Sanders, T.: On Roth\u2019s theorem on progressions. Ann. of Math. (2) 174(1), 619\u2013636 (2011)","DOI":"10.4007\/annals.2011.174.1.20"},{"issue":"3","key":"167_CR28","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/s00222-014-0562-8","volume":"201","author":"D Saxton","year":"2015","unstructured":"Saxton, D., Thomason, A.: Hypergraph containers. Invent. Math. 201(3), 925\u2013992 (2015)","journal-title":"Invent. Math."},{"key":"167_CR29","doi-asserted-by":"publisher","first-page":"107801","DOI":"10.1016\/j.aim.2021.107801","volume":"386","author":"T Schoen","year":"2021","unstructured":"Schoen, T.: Improved bound in Roth\u2019s theorem on arithmetic progressions. Adv. Math. 386, 107801\u201320 (2021)","journal-title":"Adv. Math."},{"issue":"50","key":"167_CR30","doi-asserted-by":"publisher","first-page":"305","DOI":"10.2307\/1969455","volume":"2","author":"A Selberg","year":"1949","unstructured":"Selberg, A.: An elementary proof of the prime-number theorem. Ann. of Math. 2(50), 305\u2013313 (1949)","journal-title":"Ann. of Math."},{"key":"167_CR31","doi-asserted-by":"publisher","first-page":"199","DOI":"10.4064\/aa-27-1-199-245","volume":"27","author":"E Szemer\u00e9di","year":"1975","unstructured":"Szemer\u00e9di, E.: On sets of integers containing no k elements in arithmetic progression. Acta Arith 27, 199\u2013245 (1975)","journal-title":"Acta Arith"},{"key":"167_CR32","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs, Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay,: Colloq. Internat. CNRS, vol. 260. CNRS, Paris 1978, 399\u2013401 (1976)"},{"issue":"7","key":"167_CR33","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1016\/j.jcta.2005.11.006","volume":"113","author":"T Tao","year":"2006","unstructured":"Tao, T.: A variant of the hypergraph removal lemma. J. Combin. Theory Ser. A 113(7), 1257\u20131280 (2006)","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00167-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-025-00167-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00167-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T12:38:50Z","timestamp":1757075930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-025-00167-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,23]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s00493-025-00167-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2025,7,23]]},"assertion":[{"value":"17 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"42"}}