Tag: Team seminar

Edge k-q-colorability of graphs

-- Selma Djelloul (LISN, Galac)

summary: TBA


-- Alexandre Durand (LISN, Galac)

summary: TBA


-- Philippe Rambaud (LISN, Galac)

summary: TBA


-- Tianjiao Dai (LISN, Galac)

summary: TBA

The Domino problem on rhombus-shaped tiles.

-- Benjamin Hellouin de Menibus (LISN, Galac)

summary: The word tiling is a name for several models: geometrical tilings, where you tile the plane with geometrical shapes like a jigsaw puzzle; and symbolic tilings, where you tile the plane while matching colors on the edges of tiles. You can use both kinds of constraints; a well-known example ...

Quantifiying the robustness of dynamical systems: relating time and space to length and precision

-- Manon Blanc (LISN, Galac)

summary: Reasoning about dynamical systems evolving over the reals is well-known to lead to undecidability. In particular, it is known there cannot be decision procedures for first-order theories over the reals, or decision procedures for state reachability. However, various results in the literature have shown that decision procedures exist when ...

Graph colourings, subcolourings, and beyond

-- Quentin Chuet (LISN, Galac)

summary: The graph colouring problem is central in Graph Theory: it consists in colouring the vertices of a graph such that each colour class induces an independent set, using as few colours as possible. While very difficult to solve exactly, the problem and its worst cases are now understood quite ...

Games on Tilings

-- Rémi Pallen (LISN, Galac)

summary: Given a finite set A of colors and a finite set of target
patterns F, to know if one can tile the infinite grid avoiding
patterns in F is the domino problem. This problem can be seen as a
one-player game, where the goal for the player is to ...


-- Ugo Gioccanti (G-SCOP (Grenoble))

summary: An infinite graph is quasi-transitive if its automorphism group has finitely many orbits. In this talk, I will present a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is reminiscent of the Robertson-Seymour Graph Minor Structure Theorem. We prove that every locally finite quasi-transitive graph G ...

Modular Automata Networks

-- Pacôme Perrotin (LISN, Galac)

summary: Automata networks are finite dynamical systems used to model gene regulatory networks. In this talk we talk about the difficult task of characterizing their limit behavior, and explore the formalism of modules which aims to simplify some of the technicalities related to those tasks.

Page 1 / 8 »