计算模重合
Computing modular coincidences
摘要：
计算模重合可以显示R^d中的点格上所支持的给定替换系统是否由模型集组成。我们证明了这个问题的可计算性，并确定了所需迭代次数的上界。主要工具是一个计算模重合的简单算法，它本质上是Dekking重合到多维的推广，并证明了这种推广的Dekking重合和模重合的等价性。作为结果，我们还得到了模重合存在的一些条件。在单独的一节中，并在整个文章中，给出了一些例子。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
