Finite distributive lattices, polyominoes and ideals of K\"onig type
J\"urgen Herzog, Takayuki Hibi

TL;DR
This paper classifies finite distributive lattices and certain polyominoes based on the property that their associated ideals are of K"onig type, linking lattice theory, combinatorics, and algebra.
Contribution
It provides a classification of finite distributive lattices and polyominoes with ideals of K"onig type, expanding understanding of their algebraic and combinatorial properties.
Findings
Classification of finite distributive lattices with K"onig type ideals
Identification of polyominoes with K"onig type ideals
Connection between lattice theory, polyominoes, and algebraic ideals
Abstract
Finite distributive lattices whose join-meet ideals are of K\"onig type will be classified. Furthermore, a class of polyominoes whose polyomino ideals are of K\"onig type will be studied.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Advanced Algebra and Logic · Fuzzy and Soft Set Theory
