Hyperbolic tiling neighborhoods in O(1) time
Authors:
- Yanick ThurnYTYanick Thurn
- Manuel SchrauthMSManuel Schrauth
- Johanna ErdmengerJEJohanna Erdmenger
Preprint
Abstract
Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive algorithms, which are fundamentally limited: they do not readily yield the neighborhood graph representing cell adjacencies, which is however required for many applications. We introduce a novel approach that allows to build hyperbolic tilings and their associated graph structure simultaneously, using only combinatoric rules without requiring an explicit coordinate representation. This allows to generate arbitrarily large, exact hyperbolic graphs, with an algorithmic complexity that does not depend on the lattice size. We provide an easy-to-use implementation which substantially outperforms existing methods, hence rendering ultra large-scale numerical simulations on these geometric structures accessible for the scientific community.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Discrete JT gravity as an Ising modelJournal of High Energy Physics, 2025
- Holographic foliations: Self-similar quasicrystals from hyperbolic honeycombsPhysical Review D, 2025
- Hyperbolic matter in electrical circuits with tunable complex phasesNature Communications, 2023
- Hyperbolic lattice for scalar field theory inPhysical Review D, 2022
- Lattice setup for quantum field theory inPhysical Review D, 2021
- Quantum simulation of hyperbolic space with circuit quantum electrodynamics: From graphs to geometryPhysical Review A, 2020
- Line-Graph Lattices: Euclidean and Non-Euclidean Flat Bands, and Implementations in Circuit Quantum ElectrodynamicsCommunications in Mathematical Physics, 2019
- Hyperbolic lattices in circuit quantum electrodynamicsNature, 2019
- Automatic generation of hyperbolic drawingsApplied Mathematics and Computation, 2019
- Computation in Coxeter groups II. Constructing minimal rootsRepresentation Theory, 2008