Pons, Viviane - A lattice on decreasing trees : the metasylvester lattice

dmtcs:2523 - Discrete Mathematics & Theoretical Computer Science, January 1, 2015, DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
A lattice on decreasing trees : the metasylvester lattice

Authors: Pons, Viviane

We introduce a new combinatorial structure: the metasylvester lattice on decreasing trees. It appears in the context of the $m$-Tamari lattices and other related $m$-generalizations. The metasylvester congruence has been recently introduced by Novelli and Thibon. We show that it defines a sublattice of the $m$-permutations where elements can be represented by decreasing labelled trees: the metasylvester lattice. We study the combinatorial properties of this new structure. In particular, we give different realizations of the lattice. The $m$-Tamari lattice is by definition a sublattice of our newly defined metasylvester lattice. It leads us to a new realization of the $m$-Tamari lattice, using certain chains of the classical Tamari lattice.


Source : oai:HAL:hal-01337809v1
Volume: DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Section: Proceedings
Published on: January 1, 2015
Submitted on: November 21, 2016
Keywords: $m$-Tamari lattice,weak order,sylvester congruence,trees,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 10 times.
This article's PDF has been downloaded 9 times.