Comaximal filter graphs in residuated lattices

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Atamewoue, Surdive, Tchantcho, Hugue
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866918009054953472
author Atamewoue, Surdive
Tchantcho, Hugue
author_facet Atamewoue, Surdive
Tchantcho, Hugue
contents Consider A to be a commutative, integral and non-degenerate residuated lattice. In this work, we introduce the graph of comaximal filters on the residuated lattice A. We willdenote by Cf(A) this graph for which the set of vertices are proper filters of A which are not contained in the radical of A, and the adjacency relation on vertices is given as: consider two filters F and G, there are adjacent if and only if F v G; the filter generated by F u G is equal to A. The elementary properties of this graph are provided, we establish a link between this comaximal filter graphs and the zero-divisor graphs. Furthermore, we investigate the chromatic number, the clique number, the planarity and the perfection of the graph Cf(A). We also briefly describe all the comaximal filter graphs constructed on specific residuated lattices of small size.
format Preprint
id arxiv_https___arxiv_org_abs_2505_02399
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Comaximal filter graphs in residuated lattices
Atamewoue, Surdive
Tchantcho, Hugue
Combinatorics
Commutative Algebra
Consider A to be a commutative, integral and non-degenerate residuated lattice. In this work, we introduce the graph of comaximal filters on the residuated lattice A. We willdenote by Cf(A) this graph for which the set of vertices are proper filters of A which are not contained in the radical of A, and the adjacency relation on vertices is given as: consider two filters F and G, there are adjacent if and only if F v G; the filter generated by F u G is equal to A. The elementary properties of this graph are provided, we establish a link between this comaximal filter graphs and the zero-divisor graphs. Furthermore, we investigate the chromatic number, the clique number, the planarity and the perfection of the graph Cf(A). We also briefly describe all the comaximal filter graphs constructed on specific residuated lattices of small size.
title Comaximal filter graphs in residuated lattices
topic Combinatorics
Commutative Algebra
url https://arxiv.org/abs/2505.02399