Computing modular coincidences
| dc.creator | Frettlöh, D. | |
| dc.creator | Sing, B. | |
| dc.date | 2006-01-04 | |
| dc.date | 2006-07-04 | |
| dc.date.accessioned | 2026-07-07T09:26:00Z | |
| dc.date.available | 2026-07-07T09:26:00Z | |
| dc.description | Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, 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. | |
| dc.description | 24 pages, 11 figures | |
| dc.identifier | https://arxiv.org/abs/math/0601067 | |
| dc.identifier | http://arxiv.org/abs/math/0601067 | |
| dc.identifier | Discrete Comput. Geom. 37, No.3, 381-401 (2007) | |
| dc.identifier | doi:10.1007/s00454-006-1280-9 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/156600 | |
| dc.subject | Metric Geometry | |
| dc.title | Computing modular coincidences | |
| dc.type | text |