Combinatorics, Algorithmics, and Interactions

On May 11, 2010: Inauguration of the CALIN team (and, accidentally, the 40th birthday of University Paris 13 !) Our lab is organizing a little feast, with 7 invited speakers.

Our team, established in 2010, is the junction of forces in combinatorics in the Laboratoire d'Informatique de Paris-Nord (LIPN). It includes researchers in algebraic combinatorics (symmetric functions, non-commutative and commutative stuctures: monoids, Lie algebras, Hopf algebras, algebraic graph theory) or analytic combinatorics (average-case analysis of data structures ubiquitous in algorithmics: trees, graphs, permutations, words, automata, partitions, queues...). The interaction between these two combinatorics is constant: they share tools (enumerative methods, generating series, complex analysis and functional analysis), and they share objects (many algebraic structures decompose canonically on fundamental combinatorial structures: trees, graphs, Young tableaux...). Algebraic and analytic combinatorics solve problems and consider some challenges, not only from computer sciences (analysis of algorithms, average complexity, NP-complete problems, computer algebra, random generation, information theory: coding and compression, graph theory: colorability), but also from mathematics (probability, algebra, operator theory, number theory: polyzêtas, GCD, Dirichlet series), bioinformatics (pattern matching and genomics, population genetics), and from physics (solvable models in statistical physics, critical exponents and renormalization, phase transitions, algebras of diagrams: Feynman, Heisenberg-Weyl).

Last modified: Monday 23 January 2012

Contact for this webpage: