Pebble trees
From MaRDI portal
Publication:6399098
arXiv2205.06686MaRDI QIDQ6399098FDOQ6399098
Authors: Vincent Pilaud 
Publication date: 13 May 2022
Abstract: A pebble tree is an ordered tree where each node receives some colored pebbles, in such a way that each unary node receives at least one pebble, and each subtree has either one more or as many leaves as pebbles of each color. We show that the contraction poset on pebble trees is isomorphic to the face poset of a convex polytope called pebble tree polytope. Beside providing intriguing generalizations of the classical permutahedra and associahedra, our motivation is that the faces of the pebble tree polytopes provide realizations as convex polytopes of all assocoipahedra constructed by K. Poirier and T. Tradler only as polytopal complexes.
Trees (05C05) Exact enumeration problems, generating functions (05A15) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Algebraic combinatorics (05E99)
This page was built for publication: Pebble trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399098)
