Frettlöh, Dirk and Sing, Bernd
(2007).
![[img]](http://oro.open.ac.uk/style/images/fileicons/application_pdf.png)
|
PDF (Not Set)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (473kB) |
| URL: | http://www.springerlink.com/content/1432-0444/ |
|---|---|
| DOI (Digital Object Identifier) Link: | https://doi.org/10.1007/s00454-006-1280-9 |
| Google Scholar: | Look up in Google Scholar |
Abstract
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in , 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 the 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.
| Item Type: | Article |
|---|---|
| ISSN: | 0179-5376 |
| Extra Information: | Article includes 11 figures. The original publication is available at www.springerlink.com. Some of the symbols may not have transferred correctly into this bibliographic record and/or abstract. |
| Keywords: | model sets; lattice substitution systems; coincidences |
| Academic Unit/School: | Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics Faculty of Science, Technology, Engineering and Mathematics (STEM) |
| Item ID: | 7503 |
| Depositing User: | Bernd Sing |
| Date Deposited: | 26 Apr 2007 |
| Last Modified: | 05 Oct 2016 17:44 |
| URI: | http://oro.open.ac.uk/id/eprint/7503 |
| Share this page: |     |
Altmetrics | Scopus Citations |
Download history for this item
These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.