zbMATH — the first resource for mathematics

On lattice representations with DCC posets. (English) Zbl 07204022
Summary: In this paper, we investigate the class of lattices representable with posets satisfying the DCC condition. We describe a way to decide whether a finite lattice is in this class. We also give a necessary condition for an arbitrary lattice to be in this class. This hints at a notion that would be a weaker version of lower boundedness.
06-XX Order, lattices, ordered algebraic structures
Full Text: DOI
[1] Schein, BM, A representation theorem for lattices, Algebra Univers., 2, 177-178 (1972) · Zbl 0257.06001
[2] Adaricheva, KV; Gorbunov, VA; Tumanov, VI, Join-semidistributive lattices and convex geometries, Adv. Math., 173, 1, 1-49 (2003) · Zbl 1059.06003
[3] Caspard, N., The lattice of permutations is bounded, Int. J. Algebra and Comput., 10, 4, 481-490 (2000) · Zbl 1008.06004
[4] Freese, R., Jez̆ek, J., Nation, J.B.: Free Latices, Mathematical Surveys and Monographs, vol. 42, Amer. Math. Soc., Providence, RI (1995)
[5] Pudlák, P.; Tůma, J., Every finite lattice can be embedded in a finite partition lattice, Algebra Univers., 10, 74-95 (1980) · Zbl 0433.06009
[6] Semenova, MV, Lattices that are embeddable in suborder lattices, Algebra and Logic, 44, 4, 270-285 (2005) · Zbl 1101.06005
[7] Sivák, B., Representations of finite lattices by orders on finite sets, Math. Slovaca, 28, 2, 203-215 (1978) · Zbl 0395.06002
[8] Whitman, PM, Lattices, equivalence relations, and subgroups, Bull. Amer. Math. Soc., 52, 507-522 (1946) · Zbl 0060.06505
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.