518 citations
- Centre National de la Recherche ScientifiqueFR385 papers
- Université Toulouse III - Paul SabatierFR261 papers
- Institut de Recherche en Informatique de ToulouseFR257 papers
- Université Toulouse-I-CapitoleFR257 papers
- Université Toulouse - Jean JaurèsFR257 papers
- Institut de Mathématiques de MarseilleFR245 papers
- Université de BordeauxFR206 papers
- Château GombertFR171 papers
- Aix-Marseille UniversitéFR110 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR107 papers
- Institut de Mécanique et d'Ingénierie de BordeauxFR62 papers
- Université Fédérale de Toulouse Midi-PyrénéesFR58 papers
8 papers · 2 filters
Ants on the highway
Anahí Gajardo, Victor Lutfalla, Michaël Rao
We perform intensive computations of Generalised Langton's Ants, discovering rules with a big number of highways. We depict the structure of some of them, formally proving that the…
Bootstrap percolation on rhombus tilings
S Esnay, V Lutfalla, G Theyssier
2-boostrap percolation on a graph is a diffusion process where a vertex gets infected whenever it has at least 2 infected neighbours, and then stays infected forever. It has been m…
Aperiodic monotiles: from geometry to groups
Thierry Coulbois, Anahí Gajardo, Pierre Guillon +1
In 2023, two striking, nearly simultaneous, mathematical discoveries have excited their respective communities, one by Greenfeld and Tao, the other (the Hat tile) by Smith, Myers,…
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…
Computation of Immediate Neighbours of Monotone Boolean Functions
José E. R. Cury, Patrícia Tenera Roxo, Vasco Manquinho +2
Boolean networks constitute relevant mathematical models to study the behaviours of genetic and signalling networks. These networks define regulatory influences between molecular n…
FO logic on cellular automata orbits equals MSO logic
Guillaume Theyssier
We introduce an extension of classical cellular automata (CA) to arbitrary labeled graphs, and show that FO logic on CA orbits is equivalent to MSO logic. We deduce various results…