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.
منابع مشابه
Computing Modular Coincidences for Substitution Tilings and Point Sets
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R, 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 t...
متن کاملKnot polynomial identities and quantum group coincidences
We construct link invariants using the D2n subfactor planar algebras, and use these to prove new identities relating certain specializations of colored Jones polynomials to specializations of other quantum knot polynomials. These identities can also be explained by coincidences between small modular categories involving the even parts of the D2n planar algebras. We discuss the origins of these ...
متن کاملMathematical Analysis of Subjectively Defined Coincidences; a case study using Wikipedia
Rationalists assert that real-life coincidences occur no more frequently than is predictable by chance, but (outside stylized settings such as birthdays) empirical evidence is scant. We describe a study, with a few real-life features, of coincidences noticed in reading random articles in Wikipedia. Part of a rationalist program (that one can use specific observed coincidences to infer general t...
متن کاملThe Shape of Absolute Coincidences. Salmon's Interactive Fork Model as Shape of Coincidental Processes
According to a particular view, chance events are not uncaused but they are simply the result of intersecting causal lines. More precisely, the intersections between different processes that belong to independent causal chains are the origin of accidental events, called absolute coincidences. This paper provides a new account devoted to showing the strong relation between absolute coincidences ...
متن کاملFrom mere coincidences to meaningful discoveries q
People’s reactions to coincidences are often cited as an illustration of the irrationality of human reasoning about chance. We argue that coincidences may be better understood in terms of rational statistical inference, based on their functional role in processes of causal discovery and theory revision. We present a formal definition of coincidences in the context of a Bayesian framework for ca...
متن کامل