Appears in collection : 2023 - T3 - WS3 - Topical day: Elimination for functional equations

Enumerative combinatorics contains a vast landscape of problems that could hardly be solved without the consideration of special functional equations called “Discrete Differential Equations”. Among these problems, the enumeration of walks, planar maps carrying hard particles, etc. These functional equations relate formal power series in n variables with specializations of them to some of the variables (the specializations being generating functions related to the enumeration of interest). When the involved variables are “nested”, a celebrated result by Popescu (1986) implies algebraicity of the solutions. In 2006, Bousquet-Mélou and Jehanne provided an elementary proof of algebraicity of the solutions in the case $n=2$. Their proof yields an algorithm, and it has been the state-of-the-art in enumerative combinatorics for solving these equations since then. In this talk, I will present a recent approach, based on the intensive use of effective algebraic geometry, in order to solve more efficiently such equations in the case $n=2$. Also, I will introduce and discuss recent advances in the case of systems of such equations.

The talk is based on joint works with Alin Bostan, Mohab Safey El Din and Sergey Yurkevich

Information about the video

Citation data

  • DOI 10.57987/IHP.2023.T3.WS3.TD.003
  • Cite this video Notarantonio, Hadrien (11/12/2023). Solving equations from combinatorics via computer algebra. IHP. Audiovisual resource. DOI: 10.57987/IHP.2023.T3.WS3.TD.003
  • URL

Last related questions on MathOverflow

You have to connect your account with mathoverflow to add question

Ask a question on MathOverflow


  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
  • Get notification updates
    for your favorite subjects
Give feedback
Loading the web debug toolbar…
Attempt #