Mireille Bousquet-Mélou

from Wikipedia, the free encyclopedia
Mireille Bousquet-Mélou, Oberwolfach 2014

Mireille Bousquet-Mélou (born May 12, 1967 ) is a French mathematician who deals with counting combinatorics .

She studied from 1986 at the École normal supérieure (Rue d'Ulm) with the Agrégation in 1989 and received her doctorate from the University of Bordeaux with Xavier Gérard Viennot in 1991 ( q-Énumération de polyominos convexes ). She has been researching for the CNRS since 1990 , where she Is Research Director at the Computer Science Laboratory in Bordeaux. In 1996 she qualified as a professor.

She was a visiting scholar in Leipzig, at the Schrödinger Institute in Vienna, at the MSRI , in Gothenburg, Montreal, Melbourne and at the Mittag-Leffler Institute .

She found that problems of counting combinatorics whose generating functions are rational functions often correspond to regular formal languages ​​and those with algebraic functions to context-free languages.

She was invited speaker at the International Congress of Mathematicians 2006 in Madrid ( Rational and algebraic series in combinatorial enumeratioin ). In 1993 she received the bronze medal and in 2014 the silver medal of the CNRS. In 2005 she received an honorary doctorate from Linköping University and in 2009 she received the Prix Freycinet from the Academie des Sciences.

Fonts

  • A method for the enumeration of various classes of column-convex polygons , Discrete Mathematics, Volume 154, 1996, pp. 1-25
  • with Marko Petkovsek: Linear recurrences with constant coefficients: the multivariate case , Discrete Mathematics, Volume 225, 2000, pp. 51–75.
  • with Cyril Banderier, Alain Denise, Philippe Flajolet, Danièle Gardy, Dominique Gouyou-Beauchamps: Generating functions for generating trees , Discrete Mathematics, Volume 246, 2002, pp. 29-55

Web links

Individual evidence

  1. Mireille Bousquet-Mélou in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used