Permutrees

Abstract : We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. In this extended abstract, we summarize our main results describing combinatorial and geometric properties of permutrees, in particular the permutree lattices (specializing to the weak order, the Tamari, the Cambrian and the boolean lattice) and permutreehedra (specializing to the permutahedron, the associahedra, and the cube).
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01575092
Contributor : Viviane Pons <>
Submitted on : Thursday, August 17, 2017 - 5:58:20 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:28 PM

Identifiers

Citation

Viviane Pons, Vincent Pilaud. Permutrees. The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), Aug 2017, Vienne, Austria. pp.987 - 993, ⟨10.1016/j.endm.2017.07.063. ⟩. ⟨hal-01575092⟩

Share

Metrics

Record views

378