Duality of graded graphs through operads (Q2033471)

Given a graded set \(G\), a graded graph on this set is a graph whose set of vertices is \(G\) and such that the grading difference between the ends of an edge is exactly one. It is possible to associate to such graphs generating series which count paths on them. For a certain notion of duality on these graphs, due to Fomin, one can recover some combinatorial identities. For instance, the Cauchy identity relating the number of standard Young tableaux and the number of permutations is given by the paths on the Young lattice and its dual graph. The author uses non-symmetric operads, an algebraic structure encoding products, to construct pairs of such dual graded graphs, with adjacency relations given by composition with a generator of the operad. These graphs are called prefix graded graphs. The author study the properties of the associated poset and describes its intervals. He also generalizes Fomin's duality and applies this construction to several non-symmetric operads such as the associative and the diassociative operads, integer compositions, Motzkin paths and m-trees operads.