[1] Billera, L. J., Sarangarajan, A.: The combinatorics of permutation polytopes. In: Formal Power Series and Algebraic Combinatorics, DISMACS Series in Discrete Mathematics and Theoretical Computer Science 24, AMS, Providence 1996, pp. 1-23.
[2] Birkhoff, G.: Lattice Theory. Third edition. AMS Colloquium Publications 25, AMS, Providence 1995.
[3] Brøndsted, A.: An Introduction to Convex Polytopes. Graduate Texts in Mathematics 90, Springer, New York 1983.
[4] Crisman, K.-D.:
The symmetry group of the permutahedron. Coll. Math. J. 42 (2011), 2, 136-139.
DOI
[5] Kalai, G.:
A simple way to tell a simple polytope from its graph. J. Combinator. Theory A 49 (1988), 381-383.
DOI
[6] Mohammadi, F., Uhler, C., Wang, C., Yu, J.:
Generalized permutohedra from probabilistic graphical models. SIAM Journal of Discrete Mathematics 32 (2018), 1, 640-93.
DOI
[7] Morton, J., Pachter, L., Shiu, A., Sturmfels, B., Wienand, O.:
Convex rank tests and semigraphoids. SIAM J. Discrete Math. 23 (2009), 3, 1117-1134.
DOI
[8] Postnikov, A., Reiner, V., Williams, L.:
Faces of generalized permutohedra. Documenta Mathematica 13 (2008), 207-273.
DOI
[9] Schoute, P. H.: Analytic treatment of the polytopes regularly derived from the regular polytopes. Verhandelingen der Koninklijke Akademie van Wetenschappen 11 (3), Johannes Müller, Amsterdam 1911, 87 pages.
[10] Studený, M., Kratochvíl, V.:
Graphical view on linear extensions of finite posets. Submitted to Algebraic Statistics (2026), available on
DOI
[11] Studený, M.:
Semi-graphoids viewed as collections of posets. In: Proceedings of IPMU 2026, part III., 366-397, Springer.
DOI
[12] Ziegler, G. M.:
Lectures on Polytopes. Graduate Texts in Mathematics 152, Springer, New York 1995.
Zbl 0823.52002