AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home AIMS Mathematics Article
PDF (250.2 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Subalgebra lattices of algebras determined by two unary relations and an equivalence relation

Worakrit Supaporn, Passawan Noppakaew( )
Department of Mathematics, Faculty of Science, Silpakorn University, Nakhon Pathom, 73000, Thailand
Show Author Information

Abstract

In this paper, we show the subalgebra lattice of an algebra determined by two nontrivial unary relations and a nontrivial equivalence relation on a finite set. Moreover, we use an algorithm to indicate isomorphic covering graphs of subalgebra lattices. This gives us a lower bound of the number of categorically equivalent classes of clones on a given finite set.

Keywords

latticessubalgebrascategorical equivalence of clonesisomorphic covering graphs
CLC number: 08A30, 08A40, 06B23, 05C60

References

【1】
【1】
 
 
Crossref Google Scholar
AIMS Mathematics
Volume 11 Issue 2,
February 2026
Pages 3160-3170
DOI: 10.3934/math.2026126

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Cite this Report
Close
Close
Cite this article:
Supaporn W, Noppakaew P. Subalgebra lattices of algebras determined by two unary relations and an equivalence relation. AIMS Mathematics, 2026, 11(2): 3160-3170. https://doi.org/10.3934/math.2026126

483

Views

7

Downloads

0

Crossref

0

Web of Science

0

Scopus
Received: 12 November 2025
Revised: 08 January 2026
Accepted: 14 January 2026
Published: 02 February 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)