6 problems
Let be a connected infinite graph with bounded vertex degrees. Assume that is amenable and is an abstract quasicrystal graph: for every radius and every -patter…
Let and let be an irreducible cut-and-project set. Let be a van Hove sequen…
Periodic approximability conjecture. The transversal of is periodically approximable if is defined via a cut-and-project scheme.
Let be a cut and project scheme, let be a compact set, and let \text{\Large curlywedge}(W) denote the associated model set. Write…
For a parameter , call the triangle with vertices , , and the fundamental triangle. Let be the associated closure. McNulty's fundam…
Let be a finite alphabet, and let a tiling in have a suitably defined notion of linear repetitivity. Its transversal is the tiling space consisting of tilings l…