

01:16:04
publiée le 31 mars 2025
Algorithmic methods for enumerative combinatorics - lecture 2
De Christoph Koutschan
Apparaît dans la collection : Lattice Paths, Combinatorics and Interactions / Marches aléatoires, combinatoire et interactions
We give a general construction of triangulations, starting from a walk with small steps in the quarter plane This construction is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps equipped with a rooted spanning tree and walks in the quarter plane. We also show how the construction allows to recover several known bijections between such objects in a uniform way.