Metraipolis › archive › dc_4f0845702181
Local fluctuations, majorization, and nontransitivity in cube tilings of $\mathbb{Z}^d$ — arXiv:2611.09844
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09844
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:43:52.881Z
- SHA-256 of the archived text
077d945207ccccee86ff4afd28cf2d7112348a8540cd1f5266e6dd464551a8e0- Stable URL of this page
https://metraipolis.com/documento/dc_4f0845702181
How to cite
Local fluctuations, majorization, and nontransitivity in cube tilings of $\mathbb{Z}^d$ — arXiv:2611.09844 — arXiv (en), https://arxiv.org/abs/2611.09844 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4f0845702181 (Metraipolis archive dc_4f0845702181, sha256 077d945207ccccee86ff4afd28cf2d7112348a8540cd1f5266e6dd464551a8e0)
BibTeX
@misc{dc4f0845702181,
title = {Local fluctuations, majorization, and nontransitivity in cube tilings of $mathbbZ^d$ — arXiv:2611.09844},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09844},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4f0845702181; sha256 077d945207ccccee86ff4afd28cf2d7112348a8540cd1f5266e6dd464551a8e0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09844. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $\mathcal{P}$ be a partition of $\mathbb{Z}^d$ into translates of the discrete unit cube $\{0,1\}^d$. For a uniformly chosen $\varepsilon\in\{0,1\}^d$, we count the cubes of $\mathcal{P}$ entirely contained in the observation window $[0,3]^d+\varepsilon$. The resulting score has mean $(3/2)^d$ for every partition, while its distribution reflects the geometry of the tiling. Comparing two such scores, with the shifts chosen independently, defines a game in which the larger score wins. In dimension $d=4$, we construct a geometric realization of the Steinhaus--Trybuła paradox: three periodic partitions form a cycle in which each beats the next with probability strictly greater than $1/2$. We describe local configurations by finite cube tiling codes and prove that every resulting list of counts is majorized by that of the simple code $C_d=\{0,2\}^d$. Nevertheless, every non-simple code differing from $C_d$ in only two coordinate directions beats it, with a sharp lower bound on the winning margin. We also show that the ratio of wins to losses of $C_d$ has limit superior at most $1$ as the dimension tends to infinity, uniformly over opposing codes. For $4\mathbb{Z}^d$-periodic tilings, changing the window size can repeatedly reverse the winner, but the winning margin eventually stabilizes separately for side lengths $4m+1$ and $4m+3$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.09844 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:36:32.154Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).