x-y duality in topological recursion

Topological recursion is an inductive procedure allowing one starting from a relatively small amount of initial data to compute the so called potential,i.e.a generating series whose coefficients carry one or another enumerative information. In the talk I will describe the origin and some consequences of a very natural duality in topological recursion.