Solvability of a triple of binary relations with an application to Green’s relations | Zendy

Thanakorn Prinyasart | Zendy; Jittisak Rakbud | Zendy; Suchat Samphavat | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Solvability of a triple of binary relations with an application to Green’s relations

Author(s) -

Thanakorn Prinyasart,

Jittisak Rakbud,

Suchat Samphavat

Publication year - 2021

Publication title -

discrete mathematics algorithms and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 16

eISSN - 1793-8317

pISSN - 1793-8309

DOI - 10.1142/s1793830922500136

Subject(s) - binary relation , mathematics , relation (database) , binary number , set (abstract data type) , monoid , algebra over a field , pure mathematics , discrete mathematics , computer science , arithmetic , programming language , database

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research