Menu Close

Counting different discrete structures

M. Rosenfeld

Date of presentation: 10/01/2022
Name of speaker : Matthieu Rosenfeld
Team : ESCAPE

Abstract: I will present two of my results and their contexts. First, I will present a proof technique that I obtained that allows to obtain bounds automatically. More precisely, from the definition of a type of vertex set on graphs expressed in a certain logic formalism (monadic second order logic) one can automatically obtain a bound on the number of such sets that can be found in any tree. I will then present another technique that allows to prove the existence of certain discrete objects by counting them. These two results are quite distant, but both rely on counting and on the use of intensive computer calculations to obtain more advanced results.

En voir plus

home

Artificial Intelligence Seminar

Danger and opportunity for R&D by 2030Tuesday 14 June 2022Campus St Priest -860 Rue de St Priest -Montpellier Scientific Coordination: Philippe MAURINE – Senior Lecturer