Hierarchy Elements in an Almost Distributive Lattice
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i3.5226Keywords:
hierarchy elements, ideals, principal ideals, almost distributive latticesAbstract
In this paper, we introduce hierarchy elements in an almost distributive lattice with respect to a non-empty set and obtain some of their algebraic properties. We characterize initial segments, ideals, and maximal sets in almost distributive lattices in terms of hierarchy sets and prove that the class of hierarchy sets forms a distributive lattice, which is not an induced sublattice. Also, we characterize hierarchy sets using compatible sets in an almost distributive lattice.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.