Computing modular coincidences
D. Frettlöh, B. Sing
Abstract
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in Rd, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the number of iterations needed. The main tool is a simple algorithm for computing modular coincidences, which is essentially a generalization of Dekking coincidence to more than one dimension, and the proof of equivalence of this generalized Dekking coincidence and modular coincidence. As a consequence, we also obtain some conditions for the existence of modular coincidences. In a separate section, and throughout the article, a number of examples are given.
Create a lesson
Related papers
The Spherical Hadwiger Theorem
Suijie Wang, Shengguo Wu
Linear isoperimetric filling inequalities in Hadamard spaces at and above the asymptotic rank
Jonas W. Peteranderl
Isometry invariant valuations on spherical polytopes
Jonas Knoerr
The Kernel Deficit Dominates Twice the Hull Deficit: A Sharp Strengthening of Nakano's Inequality
Dakota Charles Baker
In Search of Melchior's Ordinary Points
Jonathan Lenchner, Rik Sengupta
Volume and Projection Inequalities II: Determinants and Lp-Sums
Matthieu Fradelizi, Auttawich Manui, Cheikh Saliou Ndiaye et al.