25 citations · 122 across the 26 of their papers we have counts for
10 papers · 1 filter
Aperiodic Subshifts on Polycyclic Groups
Emmanuel Jeandel
We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the r…
An aperiodic set of 11 Wang tiles
Emmanuel Jeandel, Michael Rao
We present a new aperiodic tileset containing 11 Wang tiles on 4 colors, and we show that this tileset is minimal, in the sense that no Wang set with either fewer than 11 tiles or…
Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra
Emmanuel Jeandel
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidi…
Characterizations of periods of multidimensional shifts
Emmanuel Jeandel, Pascal Vanier
We show that the sets of periods of multidimensional shifts of finite type (SFTs) are exactly the sets of integers of the complexity class $\NE$. We also show that the functions co…
Hardness of conjugacy and factorization of multidimensional subshifts of finite type
Jeandel Emmanuel, Pascal Vanier
We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension . In particular, we prove that the factorization problem is $Σ^…
Pi01 sets and tilings
Emmanuel Jeandel, Pascal Vanier
In this paper, we prove that given any Π^0_1 subset of $\{0,1\}^\NN$ there is a tileset with a set of configurations such that $P\times\ZZ^2$ is recursively homeomorphi…