Category: seminars
Edge k-q-colorability of graphs
summary: TBA
TBA
summary: TBA
TBA
summary: TBA
TBA
summary: TBA
The Domino problem on rhombus-shaped tiles.
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 ...
Une généralisation de la correspondance RSK via des représentations de carquois (de type A)
La correpondance de Robinson-Schensted-Knuth est une bijection partant des matrices d'entiers naturels vers les paires de tableaux de Young semi-standards. Une version généralisée donne une bijection entre des remplissages d'un tableau d'une certaine forme, et les partitions planes renversés de la même forme.
D'un point de ...
Quantifiying the robustness of dynamical systems: relating time and space to length and precision
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
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 ...
Column-convex {0,1}-matrices, consecutive coordinate polytopes and flow polytopes
We study normalized volumes of a family of polytopes associated with column-convex {0,1}-matrices. Such a family is a generalization of the family of consecutive coordinate polytopes, studied by Ayyer, Josuat-Vergès, and Ramassamy, which in turn generalizes a family of polytopes originally proposed by Stanley in EC1. We prove ...
Games on Tilings
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 ...
Page 1 / 21 »