Abstract
Valuations on finite lattices have been known for a long time. In this paper, we present a combinatorial procedure called modularization that associates a modular lattice to any given finite lattice such that they have the same valuation polytopes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Birkhoff, G.: Lattice Theory, vol. 25. American Mathematical Soc., Providence (1967)
Chappell, T., Friedl, T., Sanyal, R.: Two double poset polytopes. SIAM J. Discret. Math. 31(4), 2378–2413 (2017)
Dobbertin, H.: About polytopes of valuations on finite distributive lattices. Order 2(2), 193–198 (1985)
Geissinger, L.: The face structure of a poset polytope. In: Proceedings of the Third Caribbean Conference on Combinatorics and Computing, vol. 59. Univ. West Indies, Barbados (1981)
Grätzer, G.: General Lattice Theory. Springer Science & Business Media (2002)
Grätzer, G., Wehrung, F.: Tensor products of semilattices with zero, revisited. J. Pure Appl. Algebra 147(3), 273–301 (2000)
Liu, F.: On positivity of Ehrhart polynomials. arXiv:1711.09962 (2017)
Stanley, R: Two poset polytopes. Discret. Comput. Geom. 1(1), 9–23 (1986)
Stanley, R.: Enumerative Combinatorics, vol. 1. Cambridge University Press, Cambridge (2012)
Acknowledgements
The author thanks Prof. Richard Stanley for supervising this project.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Gao, Y. A Note on the Modularization of Lattices. Order 37, 311–318 (2020). https://doi.org/10.1007/s11083-019-09507-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-019-09507-1