$f$-vector inequalities for order and chain polytopes
DOI:
https://doi.org/10.7146/math.scand.a-143995Abstract
The order and chain polytopes are two $0/1$-polytopes constructed from a finite poset. In this paper, we study the $f$-vectors of these polytopes. We investigate how the order and chain polytopes behave under disjoint unions and ordinal sums of posets, and how the $f$-vectors of these polytopes are expressed in terms of $f$-vectors of smaller polytopes. Our focus is on comparing the $f$-vectors of the order and chain polytope built from the same poset. In our main theorem we prove that for a family of posets built inductively by taking disjoint unions and ordinal sums of posets, for any poset $\mathcal {P}$ in this family the $f$-vector of the order polytope of $\mathcal {P}$ is component-wise at most the $f$-vector of the chain polytope of $\mathcal {P}$.
References
Ahmad, I., Fourier, G., and Joswig, M., Order and chain polytopes of maximal ranked posets, 2023, arXiv:2309.01626 https://doi.org/10.48550/arXiv.2309.01626
Ardila, F., Bliem, T., and Salazar, D., Gelfand–Tsetlin polytopes and Feigin–Fourier–Littelmann–Vinberg polytopes as marked poset polytopes, J. Combin. Theory Ser. A 118 (2011), no. 8, 2454–2462. https://doi.org/10.1016/j.jcta.2011.06.004
Fang, X., and Fourier, G., Marked chain-order polytopes, European J. Combin. 58 (2016), 267–282. /https://doi.org/10.1016/j.ejc.2016.06.007
Goodman, J. E., O'Rourke, J., and Tóth, C. D. (eds.), Handbook of discrete and computational geometry, third ed., Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL, 2018.
Hibi, T., Distributive lattices, affine semigroup rings and algebras with straightening laws, Commutative algebra and combinatorics (Kyoto, 1985), 93–109, Adv. Stud. Pure Math., 11, North-Holland, Amsterdam, 1987. https://doi.org/10.2969/aspm/01110093
Hibi, T., and Li, N., Chain polytopes and algebras with straightening laws, Acta Math. Vietnam. 40 (2015), no. 3, 447–452. https://doi.org/10.1007/s40306-015-0115-2
Hibi, T., and Li, N., Unimodular equivalence of order and chain polytopes, Math. Scand. 118 (2016), no. 1, 5–12. https://doi.org/10.7146/math.scand.a-23291
Hibi, T., Li, N., Sahara, Y., and Shikama, A., The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set, Discrete Math. 340 (2017), no. 5, 991–994. https://doi.org/10.1016/j.disc.2017.01.005
Jochemko, K., and Sanyal, R., Arithmetic of marked order polytopes, monotone triangle reciprocity, and partial colorings, SIAM J. Discrete Math. 28 (2014), no. 3, 1540–1558. https://doi.org/10.1137/130944849
McMullen, P., Constructions for projectively unique polytopes, Discrete Math. 14 (1976), no. 4, 347–358. /https://doi.org/10.1016/0012-365X(76)90067-4
Stanley, R. P., Two poset polytopes, Discrete Comput. Geom. 1 (1986), no. 1, 9–23. https://doi.org/10.1007/BF02187680
Stanley, R. P., Enumerative combinatorics, Volume 1, second edition. Cambridge Studies in Advanced Mathematics, 49. Cambridge University Press, Cambridge, 2012.
Ziegler, G. M., Lectures on polytopes, Graduate Texts in Mathematics, 152. Springer-Verlag, New York, 1995. https://doi.org/10.1007/978-1-4613-8431-1
