Metraipolis › archive › dc_dcdcaf05d11c

Random Fibonacci Tilings — arXiv:2611.08317

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08317
License (as archived)
CC0-1.0
Archived
2026-11-06T14:52:19.897Z
SHA-256 of the archived text
b709c5bce7420fc21fcf45f83577cdb4ca211351ae79482cc22a7e89b68627b9
Stable URL of this page
https://metraipolis.com/documento/dc_dcdcaf05d11c

How to cite

Random Fibonacci Tilings — arXiv:2611.08317 — arXiv (en), https://arxiv.org/abs/2611.08317 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dcdcaf05d11c (Metraipolis archive dc_dcdcaf05d11c, sha256 b709c5bce7420fc21fcf45f83577cdb4ca211351ae79482cc22a7e89b68627b9)
BibTeX
@misc{dcdcdcaf05d11c,
  title = {Random Fibonacci Tilings — arXiv:2611.08317},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08317},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dcdcaf05d11c; sha256 b709c5bce7420fc21fcf45f83577cdb4ca211351ae79482cc22a7e89b68627b9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08317. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Fibonacci spiral is formed by a square-joining rule: begin with a unit square and attach squares whose side lengths follow the Fibonacci sequence; in the standard construction, choices of direction produce a spiral and a tiling of the plane. We study a randomization of this construction, in which the attachment axis alternates deterministically, while fair coin flips determine direction. For a lattice point we ask when the growing rectangle first covers that point and how the expected covering time depends on its location. Tracking the rectangle's boundary reduces this question to random subset sums of even- and odd-indexed Fibonacci numbers. We extend the construction to d dimensions, where coordinate subsequences are super-increasing, allowing us to derive exact covering probabilities and formulas for the expectation and variance. For $d\geq2$, the expected covering time grows logarithmically with distance from the initial block, while the variance remains uniformly bounded. We obtain exponential tail bounds for the delay beyond the earliest feasible covering stage. Finally, we extend the Fibonacci spiral to the randomized tiling through a square-by-square construction using circular arcs and quintic connectors. This construction uses one-step lookahead, admits a continuously differentiable parameterization, and recovers the Fibonacci spiral for the standard tiling.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.08317 — 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-06T14:23:57.625Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).