When a quotient of a distributive lattice is a boolean algebra
Hasan Barzegar

TL;DR
This paper explores conditions under which a quotient of a distributive lattice, defined via a specific congruence related to an ideal and a derivation, results in a Boolean algebra.
Contribution
It introduces a new lattice congruence based on an ideal and a derivation, and characterizes when the quotient lattice is Boolean.
Findings
Identifies necessary and sufficient conditions for the quotient to be Boolean.
Defines a new congruence relation on distributive lattices.
Provides theoretical criteria for Boolean quotient structures.
Abstract
In this article, we introduce a lattice congruence with respect to a nonempty ideal of a distributive lattice and a derivation on denoted by . We investigate some necessary and sufficient conditions for the quotient algebra to become a Boolean algebra.
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
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Rings, Modules, and Algebras
