International audienceWe 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)
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary s...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary s...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...