A lattice on decreasing trees: the metasylvester lattice

MaRDI QIDQ2803308zbMATH OpenFDO

Authors Viviane Pons

Publication date 4 May 2016

Full work available at URL https://arxiv.org/abs/1501.04868

zbMATH Keywords

weak order\(m\)-Tamari latticeSylvester congruence

Mathematics Subject Classification ID

Trees (05C05) Algebraic combinatorics (05Exx)

Abstract: 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.

Recommendations

• A class of lattices associated with trees
• On the lower length of the closed-set lattice of a tree
• LATTICES ON PARABOLIC TREES
• The tree lattice existence theorems
• Trees on hyperbolic lattices
• Lattices on nonuniform trees.
• Lattice embeddings of trees
• Metrics on the multirubric lattice of a rubricator tree
• scientific article; zbMATH DE number 1406265
• Lattices of labelled ordered trees. II

Cited in

(3)

• The \(s\)-weak order and \(s\)-permutahedra
• The \(s\)-weak order and \(s\)-permutahedra. I: Combinatorics and lattice structure
• Oriented flip graphs of polygonal subdivisions and noncrossing tree partitions

This page was built for publication: A lattice on decreasing trees: the metasylvester lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803308)