Saved in:
Bibliographic Details
Main Author: Chapoton, Frédéric
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2503.04247
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916915518111744
author Chapoton, Frédéric
author_facet Chapoton, Frédéric
contents Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of these polytopes and posets, using the tree structure. For linear arbors, we propose a conjecture exchanging the Ehrhart polynomial of the polytope with the Zeta polynomial of the poset for the reverse arbor. The general motivation comes from the action of a transmutation operator acting on M -triangles, which should link the posets considered here with some kinds of generalized noncrossing partitions and generalized associahedra. We give some evidence for this relationship in several cases, including notably some polytopes, namely halohedra and Hochschild polytopes.
format Preprint
id arxiv_https___arxiv_org_abs_2503_04247
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On posets and polytopes attached to arbors
Chapoton, Frédéric
Combinatorics
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of these polytopes and posets, using the tree structure. For linear arbors, we propose a conjecture exchanging the Ehrhart polynomial of the polytope with the Zeta polynomial of the poset for the reverse arbor. The general motivation comes from the action of a transmutation operator acting on M -triangles, which should link the posets considered here with some kinds of generalized noncrossing partitions and generalized associahedra. We give some evidence for this relationship in several cases, including notably some polytopes, namely halohedra and Hochschild polytopes.
title On posets and polytopes attached to arbors
topic Combinatorics
url https://arxiv.org/abs/2503.04247