We use a recently introduced combinatorial object, the $\textit{interval-poset}$, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some previously known results. The first one is an inner bijection between Tamari intervals that exchanges the $\textit{initial rise}$ and $\textit{lower contacts}$ statistics. Those were introduced by Bousquet-Mélou, Fusy, and Préville-Ratelle who proved they were symmetrically distributed but had no combinatorial explanation. The second bijection sends a Tamari interval to a closed flow of an ordered forest. These combinatorial objects were studied by Chapoton in the context of the Pre-Lie operad and the connection with the Tamari order was still unclear.

Source : oai:HAL:hal-01207596v1

Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)

Section: Proceedings

Published on: January 1, 2014

Submitted on: November 21, 2016

Keywords: Tamari lattice,Tamari intervals,binary trees,flows of ordered trees,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

This page has been seen 30 times.

This article's PDF has been downloaded 63 times.