• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.777-788
• /
• 2018

A simple poset is a poset whose linear discrepancy increases if any relation of the poset is removed. In this paper, we investigate more important properties of simple posets such as its width and height which help to construct concrete simple poset of linear discrepancy l. The simplicity of a poset is similar to the ld-irreducibility of a poset. Hence, we investigate which posets are both simple and ld-irreducible. Using these properties, we characterize n-posets of linear discrepancy n - k for k = 2, 3, and, lastly, we also characterize a poset of linear discrepancy 3 with simple posets and ld-irreducible posets.

• Kyungpook Mathematical Journal
• /
• v.60 no.1
• /
• pp.1-20
• /
• 2020

A simple but elegant result of Rival states that every sublattice L of a finite distributive lattice 𝒫 can be constructed from 𝒫 by removing a particular family 𝒥_L of its irreducible intervals. Applying this in the case that 𝒫 is a product of a finite set 𝒞 of chains, we get a one-to-one correspondence L ↦ 𝒟_𝒫(L) between the sublattices of 𝒫 and the preorders spanned by a canonical sublattice 𝒞^⋄ of 𝒫. We then show that L is a tight sublattice of the product of chains 𝒫 if and only if 𝒟_𝒫(L) is asymmetric. This yields a one-to-one correspondence between the tight sublattices of 𝒫 and the posets spanned by its poset J(𝒫) of non-zero join-irreducible elements. With this we recover and extend, among other classical results, the correspondence derived from results of Birkhoff and Dilworth, between the tight embeddings of a finite distributive lattice L into products of chains, and the chain decompositions of its poset J(L) of non-zero join-irreducible elements.