Tag: Team seminar
TBA
summary: TBA
TBA
summary: TBA
Classes de sous-shifts définis par des formules logiques.
summary: Une configuration est un coloriage du plan Z². Habituellement, les ensembles de configurations étudiés sont ceux définis par un ensemble de motifs "interdits" n'apparaissant dans aucune des configurations de l'ensemble. De tels ensembles sont appelés sous-shifts. Dans ce séminaire, on définit les ensembles de configurations grâce à ...
Manytamaris: on descriptions of the Tamari lattice
summary: Manytamaris is a website about the Tamari lattice. The interest in this particular lattice stems from its many properties, besides being a lattice, and its numerous appearances in different areas of mathematics. As such, the goal for Manytamaris is to be a survey on the descriptions of the Tamari ...
Algorithms for Stochastic Analysis Using SageMath
summary: This talk explores algorithms for computations in stochastic analysis and their increasing relevance in modern mathematics. We present algorithms to explicitly solve Stochastic Differential Equations via Itô's Lemma, and derive solutions of certain partial differential equations using Feynman–Kac formula. Hence, emphasizing the need for developing SageMath packages ...
Eliminating more than vertices in graphs
summary: Considérons le jeu suivant sur un graphe. À chaque tour, le joueur peut enlever un sommet de chaque composante connexe du graphe courant. Le but du jeu est d’éliminer tous les sommets du graphe. Le nombre minimum de tours nécessaires est appelé la treedepth du graphe. C’est ...
Reconstruction de graphes via des requêtes sur les triplets
summary: Considérons un oracle disposant d'un graphe labellisé caché. L'objectif de la reconstruction de graphes est de retrouver ce graphe caché en interrogeant l'oracle avec certains types de requêtes. Les requêtes que nous examinons portent sur des triplets de sommets du graphe, plus précisément, sur la structure ...
Fractional domatic number and minimum degree
summary: We present a study of a graph parameter in graph theory, named the fractional domatic number. A dominating set in a graph is a set of vertices such that every vertex outside the set is adjacent to a vertex in the set. The domatic number of a graph is ...
Travo: a classroom open source Python toolkit
summary: Teaching computer science or computational courses inevitably implies collaboration on code. Software forges can provide helpful infrastructure to support and improve collaboration in teaching workflows. This talk will present Travo, an open source Python toolkit turning your favorite forge into a flexible management solution for computer assignments. Travo is ...
The Canadian Traveller Problem on outerplanar graphs
summary: We focus on the PSPACE-complete k-Canadian Traveller Problem, where a weighted graph with a source s and a target t are given. This problem also has a hidden input of cardinality at most k representing blocked edges. The objective is to travel from s to t with the minimum ...
Page 1 / 11 »