{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T11:23:12Z","timestamp":1761218592420,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1764034"],"award-info":[{"award-number":["1764034"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A well-known open problem of Meir and Moser asks if the squares of sidelength 1\/<jats:italic>n<\/jats:italic> for <jats:inline-formula><jats:alternatives><jats:tex-math>$$n\\ge 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> can be packed perfectly into a rectangle of area <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sum _{n=2}^\\infty n^{-2}=\\pi ^2\/6-1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msubsup>\n                      <mml:mo>\u2211<\/mml:mo>\n                      <mml:mrow>\n                        <mml:mi>n<\/mml:mi>\n                        <mml:mo>=<\/mml:mo>\n                        <mml:mn>2<\/mml:mn>\n                      <\/mml:mrow>\n                      <mml:mi>\u221e<\/mml:mi>\n                    <\/mml:msubsup>\n                    <mml:msup>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mo>-<\/mml:mo>\n                        <mml:mn>2<\/mml:mn>\n                      <\/mml:mrow>\n                    <\/mml:msup>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:msup>\n                      <mml:mi>\u03c0<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msup>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mn>6<\/mml:mn>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. In this paper we show that for any <jats:inline-formula><jats:alternatives><jats:tex-math>$$1\/2&lt;t&lt;1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mo>&lt;<\/mml:mo>\n                    <mml:mi>t<\/mml:mi>\n                    <mml:mo>&lt;<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and any <jats:inline-formula><jats:alternatives><jats:tex-math>$$n_0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> that is sufficiently large depending on\u00a0<jats:italic>t<\/jats:italic>, the squares of sidelength <jats:inline-formula><jats:alternatives><jats:tex-math>$$n^{-t}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>-<\/mml:mo>\n                      <mml:mi>t<\/mml:mi>\n                    <\/mml:mrow>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for <jats:inline-formula><jats:alternatives><jats:tex-math>$$n\\ge n_0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mn>0<\/mml:mn>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> can be packed perfectly into a square of area <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sum _{n=n_0}^\\infty n^{-2t}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msubsup>\n                      <mml:mo>\u2211<\/mml:mo>\n                      <mml:mrow>\n                        <mml:mi>n<\/mml:mi>\n                        <mml:mo>=<\/mml:mo>\n                        <mml:msub>\n                          <mml:mi>n<\/mml:mi>\n                          <mml:mn>0<\/mml:mn>\n                        <\/mml:msub>\n                      <\/mml:mrow>\n                      <mml:mi>\u221e<\/mml:mi>\n                    <\/mml:msubsup>\n                    <mml:msup>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mo>-<\/mml:mo>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mi>t<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:msup>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. This was previously known (if one packs a rectangle instead of a square) for <jats:inline-formula><jats:alternatives><jats:tex-math>$$1\/2&lt;t\\le 2\/3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mo>&lt;<\/mml:mo>\n                    <mml:mi>t<\/mml:mi>\n                    <mml:mo>\u2264<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> (in which case one can take <jats:inline-formula><jats:alternatives><jats:tex-math>$$n_0=1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>n<\/mml:mi>\n                      <mml:mn>0<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>).<\/jats:p>","DOI":"10.1007\/s00454-023-00523-y","type":"journal-article","created":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T21:01:33Z","timestamp":1688245293000},"page":"1178-1189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Perfectly Packing a Square by Squares of Nearly Harmonic Sidelength"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0140-7641","authenticated-orcid":false,"given":"Terence","family":"Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,1]]},"reference":[{"key":"523_CR1","volume-title":"Research Problems in Discrete Geometry","author":"P Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)"},{"issue":"2","key":"523_CR2","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/jcta.2000.3058","volume":"92","author":"A Chalcraft","year":"2000","unstructured":"Chalcraft, A.: Perfect square packings. J. Comb. Theory Ser. A 92(2), 158\u2013172 (2000)","journal-title":"J. Comb. Theory Ser. A"},{"key":"523_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0963-8","volume-title":"Unsolved Problems in Geometry. Problem Books in Mathematics. Unsolved Problems in Intuitive Mathematics","author":"HT Croft","year":"1991","unstructured":"Croft, H.T., Falconer, K.J., Guy, R.K.: Unsolved Problems in Geometry. Problem Books in Mathematics. Unsolved Problems in Intuitive Mathematics, vol. 2. Springer, New York (1991)"},{"key":"523_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.jcta.2018.11.004","volume":"162","author":"P Grzegorek","year":"2019","unstructured":"Grzegorek, P., Januszewski, J.: A note on three Moser\u2019s problems and two Paulhus\u2019 lemmas. J. Comb. Theory Ser. A 162, 222\u2013230 (2019)","journal-title":"J. Comb. Theory Ser. A"},{"key":"523_CR5","doi-asserted-by":"crossref","unstructured":"Januszewski, J., Zielonka, \u0141.: A note on perfect packing of squares and cubes. Acta Math. Hungar. 163(2), 530\u2013537 (2021)","DOI":"10.1007\/s10474-020-01114-6"},{"issue":"9","key":"523_CR6","doi-asserted-by":"publisher","first-page":"2544","DOI":"10.1016\/j.disc.2018.06.007","volume":"341","author":"A Jo\u00f3s","year":"2018","unstructured":"Jo\u00f3s, A.: On packing of rectangles in a rectangle. Discrete Math. 341(9), 2544\u20132552 (2018)","journal-title":"Discrete Math."},{"issue":"2","key":"523_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10474-018-0858-z","volume":"156","author":"A Jo\u00f3s","year":"2018","unstructured":"Jo\u00f3s, A.: Perfect packing of cubes. Acta Math. Hungar. 156(2), 375\u2013384 (2018)","journal-title":"Acta Math. Hungar."},{"issue":"2","key":"523_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jcta.2001.3209","volume":"97","author":"G Martin","year":"2002","unstructured":"Martin, G.: Compactness theorems for geometric packings. J. Comb. Theory Ser. A 97(2), 225\u2013238 (2002)","journal-title":"J. Comb. Theory Ser. A"},{"key":"523_CR9","doi-asserted-by":"publisher","DOI":"10.4153\/S0008439523000140","author":"R McClenagan","year":"2023","unstructured":"McClenagan, R.: Perfectly packing a cube by cubes of nearly harmonic sidelength. Can. Math. Bull. (2023). https:\/\/doi.org\/10.4153\/S0008439523000140","journal-title":"Can. Math. Bull."},{"key":"523_CR10","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S0021-9800(68)80047-X","volume":"5","author":"A Meir","year":"1968","unstructured":"Meir, A., Moser, L.: On packing of squares and cubes. J. Comb. Theory 5, 126\u2013134 (1968)","journal-title":"J. Comb. Theory"},{"issue":"2","key":"523_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1006\/jcta.1997.2836","volume":"82","author":"MM Paulhus","year":"1998","unstructured":"Paulhus, M.M.: An algorithm for packing squares. J. Comb. Theory Ser. A 82(2), 147\u2013157 (1998)","journal-title":"J. Comb. Theory Ser. A"},{"key":"523_CR12","doi-asserted-by":"crossref","unstructured":"Sono, K.: Perfectly packing a square by squares of sidelength $$f(n)^{-t}$$. Discrete Math. 346(4), #\u00a0113293 (2023)","DOI":"10.1016\/j.disc.2022.113293"},{"issue":"4","key":"523_CR13","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s00454-003-0769-8","volume":"29","author":"J W\u00e4stlund","year":"2003","unstructured":"W\u00e4stlund, J.: Perfect packings of squares using the stack-pack strategy. Discrete Comput. Geom. 29(4), 625\u2013631 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"523_CR14","unstructured":"Zhu, M., Jo\u00f3s, A.: Packing $$1.35\\cdot 10^{11}$$ rectangles into a unit square (2022). arXiv:2211.10356"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00523-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00523-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00523-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T20:19:48Z","timestamp":1715026788000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00523-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,1]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["523"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00523-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2023,7,1]]},"assertion":[{"value":"4 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}