Answers are grounded in this paper and cite their sources.
Theoretical study reveals structural connections between ornamentation and sourcing posets in directed graphs, answering an open question on polytopal realizations.
Given a directed graph D with transitive closure \,tc\,(D) tc ( D ) and path hypergraph P(D) P ( D ) , we study the connections between the (acyclic) reorientation poset of \,tc\,(D) tc ( D ) , the (acyclic) sourcing poset of P(D) P ( D ) , and the (acyclic) ornamentation poset of D . Geometrically, the acyclic reorientation poset of \,tc\,(D) tc ( D ) (resp. the acyclic sourcing poset of P(D) P ( D ) ) is the transitive closure of the skeleton of the graphical zonotope of \,tc\,(D) tc ( D ) (resp. of the hypergraphic polytope of P(D) P ( D ) ) oriented in a linear direction. When D is a rooted (or even unstarred) increasing tree, we show that the acyclic sourcing poset of P(D) P ( D ) is isomorphic to the ornamentation lattice of D , and that they form a lattice quotient of the acyclic reorientation lattice of \,tc\,(D) tc ( D ) . As a consequence, we obtain polytopal realizations of the ornamentation lattices of rooted (or even unstarred) increasing trees, answering an open question of C. Defant and A. Sack. When D is an increasing tree, we show that the ornamentation lattice of D is the MacNeille completion of the acyclic sourcing poset of P(D) P ( D ) . Finally, still when D is an increasing tree, we use the ornamentation lattice of D to characterize the subhypergraphs of the path hypergraph P(D)
No takes yet. Share an insight, caveat, or question.
Abram et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: