An Upper bound on the growth of Dirichlet tilings of hyperbolic spaces
Itai Benjamini, Tsachik Gelander

TL;DR
This paper establishes an upper bound on the growth rate of Dirichlet tilings in hyperbolic spaces, showing it is strictly less than a linear function of the number of faces, with implications for understanding tiling complexity.
Contribution
It provides a new upper bound on the growth rate of Dirichlet tilings in hyperbolic spaces, depending only on the number of faces and the dimension.
Findings
Growth rate of Dirichlet tilings is at most $k-1- ext{epsilon}$
The bound depends only on the number of faces and the space dimension
Open question about universal epsilon for all $k$-regular tilings
Abstract
It is shown that the growth rate of any faces Dirichlet tiling of the real hyperbolic space is at most , for an , depending only on and . We don't know if there is a universal , such that upperbounds the growth rate for any -regular tiling, when ?
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Cellular Automata and Applications · Stochastic processes and statistical mechanics
