LetPR be the set of patches of radius R, modulo translation. The tiling has finite local complexity (FLC), if and only if PR is a finite set for all R. In particular R→PR is locally constant and non-decreasing. Thus there is a sequence R0 = 0 < R1 < · · · < Rn < · · · with Rn→ ∞ such thatPR =Pn for Rn ≤ R < Rn+1. Inverse Limit There is a restriction map pi:Pn+1→Pn. Then the transversal is defined by the inverse limit Ξ = lim←piP
AbstractWe show that the complexity of a cutting word u in a regular tiling with a polyomino Q is eq...
We consider a symbolic coding of bi-infinite non periodic geodesics on the L-shaped translation surf...
Fibonacci numbers arise in the solution of many combinatorial problems. They count the number of bin...
Let PR be the set of patches of radius R, modulo translation. The tiling has finite local complexity...
Let PR be the set of patches of radius R, modulo translation. The tiling has finite local complexity...
We propose a formalism for tilings with infinite local complexity (ILC), and especially fusion tilin...
Abstract. We propose a formalism for tilings with infinite local complexity (ILC), and especially fu...
Let A be a finite subset of ℤ2. We say A tiles ℤ2 with the translation set C, if any integer z∈ℤ2 ca...
In the 1960’s and 1970’s, mathematicians discovered geometric patterns which displayed a high degree...
We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to P ...
We describe a tiling of the plane, motivated by architectural constructions of domes, in which the F...
The direct product of two Fibonacci tilings can be described as a genuine stone inflation rule with ...
Abstract. Let T be an aperiodic and repetitive tiling of Rd with finite local complexity. Let Ω be i...
My main research interest is combinatorics and discrete geometry. I study tilings in this context, w...
A function f 2 L 1 (R) tiles the line with a constant weight w using the discrete tile set A if P...
AbstractWe show that the complexity of a cutting word u in a regular tiling with a polyomino Q is eq...
We consider a symbolic coding of bi-infinite non periodic geodesics on the L-shaped translation surf...
Fibonacci numbers arise in the solution of many combinatorial problems. They count the number of bin...
Let PR be the set of patches of radius R, modulo translation. The tiling has finite local complexity...
Let PR be the set of patches of radius R, modulo translation. The tiling has finite local complexity...
We propose a formalism for tilings with infinite local complexity (ILC), and especially fusion tilin...
Abstract. We propose a formalism for tilings with infinite local complexity (ILC), and especially fu...
Let A be a finite subset of ℤ2. We say A tiles ℤ2 with the translation set C, if any integer z∈ℤ2 ca...
In the 1960’s and 1970’s, mathematicians discovered geometric patterns which displayed a high degree...
We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to P ...
We describe a tiling of the plane, motivated by architectural constructions of domes, in which the F...
The direct product of two Fibonacci tilings can be described as a genuine stone inflation rule with ...
Abstract. Let T be an aperiodic and repetitive tiling of Rd with finite local complexity. Let Ω be i...
My main research interest is combinatorics and discrete geometry. I study tilings in this context, w...
A function f 2 L 1 (R) tiles the line with a constant weight w using the discrete tile set A if P...
AbstractWe show that the complexity of a cutting word u in a regular tiling with a polyomino Q is eq...
We consider a symbolic coding of bi-infinite non periodic geodesics on the L-shaped translation surf...
Fibonacci numbers arise in the solution of many combinatorial problems. They count the number of bin...