{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T22:40:39Z","timestamp":1790808039755,"version":"4.1.0"},"reference-count":41,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2154082"],"award-info":[{"award-number":["DMS-2154082"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ISF","award":["1593\/24"],"award-info":[{"award-number":["1593\/24"]}]},{"DOI":"10.13039\/100011643","name":"Blavatnik Family foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011643","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>A subset [Formula: see text] of the Boolean hypercube [Formula: see text] is a sumset if [Formula: see text] for some [Formula: see text]. We prove that the number of sumsets in [Formula: see text] is asymptotically [Formula: see text]. Furthermore, we show that the family of sumsets in [Formula: see text] is almost identical to the family of all subsets of [Formula: see text] that contain a complete linear subspace of codimension 1.<\/jats:p>","DOI":"10.1137\/24m165569x","type":"journal-article","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T04:35:36Z","timestamp":1738643736000},"page":"314-326","source":"Crossref","is-referenced-by-count":1,"title":["Sumsets in the Hypercube"],"prefix":"10.1137","volume":"39","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ USA, and Tel Aviv University, Tel Aviv, Israel."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4908-878X","authenticated-orcid":true,"given":"Or","family":"Zamir","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2025,2,4]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/pdt033"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/bdq033"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2013.05.007"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.412676"},{"key":"ref5","volume-title":"The Probabilistic Method","author":"Alon N.","year":"2016","edition":"4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s003730200003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6642-0_4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983917.008"},{"key":"ref9","unstructured":"B. Barak, L. Trevisan, and A. Wigderson, A mini-course on additive combinatorics, 2007, https:\/\/www.math.cmu.edu\/~af1p\/Teaching\/AdditiveCombinatorics\/allnotes.pdf."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-020-1986-z"},{"key":"ref11","unstructured":"X. Chen, S. Nadimpalli, T. Randolph, R. A. Servedio, and O. Zamir, Testing Sumsets Is Hard, preprint, arXiv:2401.07242, 2024."},{"key":"ref12","unstructured":"D. Conlon, J. Fox, H. T. Pham, and L. Yepremyan, On the Clique Number of Random Cayley Graphs and Related Topics, 2024, https:\/\/doi.org\/10.48550\/arXiv.2412.21194."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01651330"},{"key":"ref14","series-title":"Transl. Math. Monogr.","volume-title":"Foundations of a Structural Theory of Set Addition","author":"Freiman G. A.","year":"1973"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01192522"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548310000155"},{"key":"ref17","unstructured":"D. Galvin, Independent Sets in the Discrete Hypercube, 2019, https:\/\/doi.org\/10.48550\/arXiv.1901.01991."},{"key":"ref18","author":"Gowers W. T.","year":"2024","journal-title":"Ann. Math."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-015-3129-4"},{"key":"ref20","first-page":"285","volume":"41","author":"Green B.","year":"2004","journal-title":"Stud. Sci. Math. Hungar."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0018-2"},{"key":"ref22","first-page":"1","volume-title":"Surveys in Combinatorics","author":"Green B. J.","year":"2005"},{"key":"ref23","doi-asserted-by":"crossref","unstructured":"T. E. Harris, A lower bound for the critical probability in a certain percolation process, Proc. Cambridge Philos. Soc., 56 (1960), pp. 13\u201320.","DOI":"10.1017\/S0305004100034241"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0865-5_26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12331"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301004631"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(66)80012-1"},{"key":"ref28","doi-asserted-by":"crossref","unstructured":"Z. Kelley and R. Meka, Strong bounds for 3-progressions, in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, https:\/\/doi.org\/10.1109\/FOCS57990.2023.00059.","DOI":"10.1109\/FOCS57990.2023.00059"},{"key":"ref29","first-page":"111","volume":"40","author":"Korshunov A. D.","year":"1983","journal-title":"Problemy Kibernet"},{"key":"ref30","series-title":"Grad. Surveys 8","volume-title":"Additive Combinatorics and Its Applications in Theoretical Computer Science","author":"Lovett S.","year":"2017"},{"key":"ref31","volume-title":"Sous-espaces des espaces de Banach","author":"Pajor A.","year":"1985"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.37236\/10471"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.4064\/aa146-1-6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2140\/apde.2012.5.627"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1134\/S1990478915020131"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90019-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.41.247"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1515\/dma-2020-0030"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1556154.1556170"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755149"},{"key":"ref41","series-title":"Grad. Surveys 3","volume-title":"Selected Results in Additive Combinatorics: An Exposition","author":"Viola E.","year":"2011"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/24M165569X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:18:37Z","timestamp":1787318317000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/24M165569X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,4]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1137\/24M165569X"],"URL":"https:\/\/doi.org\/10.1137\/24m165569x","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,4]]}}}