| Autor: |
Prinyasart, Thanakorn, Rakbud, Jittisak, Samphavat, Suchat |
| Zdroj: |
Discrete Mathematics, Algorithms & Applications; Dec2021, Vol. 13 Issue 6, p1-13, 13p |
| Abstrakt: |
In this paper, we introduce the notion of a solvable triple of binary relations on a set. This notion generalizes the notion of a regular relation and all other notions that are variants of the notion of the regularity, defined previously by many people. We also give some characterizations of the solvability of a triple of relations and use this to study Green's relations on the monoid of binary relations on a set. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
