Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. An n-Dimensional Gen ...
Conference paper

An n-Dimensional Generalization of the Rhombus Tiling

Joakim Linde (1), Cristopher Moore (2), Mats G. Nordahl (3)
(1) Chalmers University of Technology [Göteborg]
(2) UNM Computer Science department [New Mexico]
(3) Santa Fe Institute
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2000
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
Proceedings
DOI
10.46298/dmtcs.2293
License
https://about.hal.science/hal-authorisation-v1
Indicators
824
Views
2026
Downloads

An n-Dimensional Generalization of the Rhombus Tiling

Joakim Linde (1), Cristopher Moore (2), Mats G. Nordahl (3)
(1) Chalmers University of Technology [Göteborg]
(2) UNM Computer Science department [New Mexico]
(3) Santa Fe Institute
Abstract
Several classic tilings, including rhombuses and dominoes, possess height functions which allow us to 1) prove ergodicity and polynomial mixing times for Markov chains based on local moves, 2) use coupling from the past to sample perfectly random tilings, 3) map the statistics of random tilings at large scales to physical models of random surfaces, and and 4) are related to the "arctic circle"' phenomenon.However, few examples are known for which this approach works in three or more dimensions.Here we show that the rhombus tiling can be generalized to n-dimensional tiles for any $n ≥ 3$. For each $n$, we show that a certain local move is ergodic, and conjecture that it has a mixing time of $O(L^{n+2} log L)$ on regions of size $L$. For $n=3$, the tiles are rhombohedra, and the local move consists of switching between two tilings of a rhombic dodecahedron.We use coupling from the past to sample random tilings of a large rhombic dodecahedron, and show that arctic regions exist in which the tiling is frozen into a fixed state.However, unlike the two-dimensional case in which the arctic region is an inscribed circle, here it seems to be octahedral.In addition, height fluctuations between the boundary of the region and the center appear to be constant rather than growing logarithmically.We conjecture that this is because the physics of the model is in a "smooth" phase where it is rigid at large scales, rather than a "rough" phase in which it is elastic.
Keywords
  • [INFO]Computer Science [cs]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Tilings
  • Discrete Dynamical Systems
  • Quasicrystals
Cited by

Source: OpenCitations

  • Arctic Octahedron in Three-Dimensional Rhombus Tilings and Related Integer Solid Partitions

    arXiv (Cornell University)

    Authors : M. Widom, R. Mosseri, N. Destainville, F. Bailly

    Journal reference : Volume 109, 2002, pp. 945-965

    DOI : 10.1023/a:1020464224385
  • Estimating the Asymptotics of Solid Partitions

    arXiv (Cornell University)

    Authors : Nicolas Destainville ORCID, Suresh Govindarajan ORCID

    Journal reference : Volume 158, 2014, pp. 950-967

    DOI : 10.1007/s10955-014-1147-z
  • Fast Domino Tileability

    CaltechAUTHORS (California Institute of Technology)

    Authors : Igor Pak ORCID, Adam Sheffer ORCID, Martin Tassy ORCID

    Journal reference : Volume 56, 2016, pp. 377-394

    DOI : 10.1007/s00454-016-9807-1
Preview
Loading PDF preview...