Compositions and decompositions of binary relations

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F22%3A73615010" target="_blank" >RIV/61989592:15310/22:73615010 - isvavai.cz</a>
Result on the web
<a href="http://ma.fme.vutbr.cz/archiv/11_2/ma_11_2_chajda_langer_final.pdf" target="_blank" >http://ma.fme.vutbr.cz/archiv/11_2/ma_11_2_chajda_langer_final.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.13164/ma.2022.08" target="_blank" >10.13164/ma.2022.08</a>

Result language
angličtina
Original language name
Compositions and decompositions of binary relations
Original language description
It is well known that to every binary relation on a non-void set I there can be assigned its incidence matrix, also in the case when I is infinite. We show that a certain kind of “multiplication” of such incidence matrices corresponds to the composition of the corresponding relations. Using this fact we investigate the solvability of the equation R ◦ X = S for given binary relations R and S on I and derive an algorithm for solving this equation by using the connections between the corresponding incidence matrices. Moreover, we describe how one can obtain the incidence matrix of a product of binary relations from the incidence matrices of its factors.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GF20-09869L" target="_blank" >GF20-09869L: The many facets of orthomodularity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)