Permutrees - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Conference Papers Year : 2017

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).
Not file

Dates and versions

hal-01575092 , version 1 (17-08-2017)

Identifiers

Cite

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⟩
289 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More