Toric partial orders
Combinatorics
2012-11-20 v1
Abstract
We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite posets under the equivalence relation generated by converting minimal elements into maximal elements, or sources into sinks. We derive toric analogues for several features of ordinary partial orders, such as chains, antichains, transitivity, Hasse diagrams, linear extensions, and total orders.
Cite
@article{arxiv.1211.4247,
title = {Toric partial orders},
author = {Mike Develin and Matthew Macauley and Victor Reiner},
journal= {arXiv preprint arXiv:1211.4247},
year = {2012}
}
Comments
18 pages