A Note on the Modularization of Lattices
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.
Main Author: | Gao, Yibo |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Springer Netherlands
2021
|
Online Access: | https://hdl.handle.net/1721.1/131758.2 |
Similar Items
-
A Note on the Modularization of Lattices
by: Gao, Yibo
Published: (2021) -
Modular coordination notes
Published: (2006) -
Modularity in random regular graphs and lattices.
by: McDiarmid, C, et al.
Published: (2013) -
Semistability, modular lattices, and iterated logarithms
by: Haiden, F, et al.
Published: (2023) -
On quasi-identities of finite modular lattices
by: S. Lutsak, et al.
Published: (2022-09-01)