Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computing modular coincidences   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.

28
The categories of this paper are: alg-geom
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
32
The categories of this paper are: atom-ph
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
37
The categories of this paper are: supr-con
8
The categories of this paper are: hep-ex
1
The categories of this paper are: cs
3
The categories of this paper are: physics
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph
16
The categories of this paper are: stat
14
The categories of this paper are: math-ph