Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.17151 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909700506779648 |
|---|---|
| author | Kislovskiy, A. D. Lerner, E. Yu. Senkevich, I. A. |
| author_facet | Kislovskiy, A. D. Lerner, E. Yu. Senkevich, I. A. |
| contents | The well-known problem stated by A. Meir and L. Moser consists in tiling the unit square with rectangles (details), whose side lengths equal $1/n\times 1/(n+1)$, where indices~$n$ range from 1 to infinity. Recently, Terence Tao has proved that it is possible to tile with $1/n^t\times 1/(n+1)^t$ rectangles (squares with the side length of $1/n^t$), $1/2<t<1$, the square, whose area equals the sum of areas of these details, provided that only those details, whose indices exceed certain~$n_0$, are taken into consideration. We adduce arguments in favor of the assumption that the result obtained by T. Tao is also valid for $t=1$. We use a new tiling method (the Slack-Pack algorithm), which initially admits gaps between stacks of details. The algorithm uses a pre-fixed parameter $γ$, $\sqrt{3/2}<γ<3/2$, connected with the gap value. The new algorithm allows one to control the ratio of the area of the large rectangular part, which is free of details, to the whole area of the remaining empty space. This ratio (under certain natural assumptions) always exceeds $1-1/γ-δ$, where $δ$ tends to zero as $n_0$ increases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_17151 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Slack-Pack algorithm for Meir-Moser packing problem Kislovskiy, A. D. Lerner, E. Yu. Senkevich, I. A. Combinatorics 52C15 The well-known problem stated by A. Meir and L. Moser consists in tiling the unit square with rectangles (details), whose side lengths equal $1/n\times 1/(n+1)$, where indices~$n$ range from 1 to infinity. Recently, Terence Tao has proved that it is possible to tile with $1/n^t\times 1/(n+1)^t$ rectangles (squares with the side length of $1/n^t$), $1/2<t<1$, the square, whose area equals the sum of areas of these details, provided that only those details, whose indices exceed certain~$n_0$, are taken into consideration. We adduce arguments in favor of the assumption that the result obtained by T. Tao is also valid for $t=1$. We use a new tiling method (the Slack-Pack algorithm), which initially admits gaps between stacks of details. The algorithm uses a pre-fixed parameter $γ$, $\sqrt{3/2}<γ<3/2$, connected with the gap value. The new algorithm allows one to control the ratio of the area of the large rectangular part, which is free of details, to the whole area of the remaining empty space. This ratio (under certain natural assumptions) always exceeds $1-1/γ-δ$, where $δ$ tends to zero as $n_0$ increases. |
| title | Slack-Pack algorithm for Meir-Moser packing problem |
| topic | Combinatorics 52C15 |
| url | https://arxiv.org/abs/2412.17151 |