4 papers
On the cohomology of homshifts
Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus +1
We study the cohomology of symbolic dynamical systems called homshifts: they are the nearest-neighbour shifts of finite type whose adjacency rules are the same in ev…
Undecidability of the block gluing classes of homshifts
Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus +1
A homshift is a -dimensional shift of finite type which arises as the space of graph homomorphisms from the grid graph to a finite connected undirected graph .…
String attractors and bi-infinite words
Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus
String attractors are a combinatorial tool coming from the field of data compression. It is a set of positions within a word which captures an occurrence of every factor. While one…
Two-player Domino games
Benjamin Hellouin de Menibus, Rémi Pallen
We introduce a 2-player game played on an infinite grid, initially empty, where each player in turn chooses a vertex and colours it. The first player aims to create some pattern fr…