2 citations · 6 across the 12 of their papers we have counts for
Showing 2024 · cs.DMShow all
2 papers · 2 filters
cs.DM2024
Decision problems on geometric tilings
Benjamin Hellouin de Menibus, Victor Lutfalla, Pascal Vanier
We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that…
cs.DM2024★ 1 cited
Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints
Antonin Callard, Léo Paviet Salomon, Pascal Vanier
Subshifts are sets of colorings of defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissi…