A. A. Klyushin, I. B. Kozhukhov, D. Yu. Manilov, A. V. Reshetnikov
{"title":"Definability of Relations by Semigroups\nof Isotone Transformations","authors":"A. A. Klyushin, I. B. Kozhukhov, D. Yu. Manilov, A. V. Reshetnikov","doi":"10.1134/S199047892401006X","DOIUrl":null,"url":null,"abstract":"<p> In 1961, L.M. Gluskin proved that a given set\n<span>\\( X \\)</span> with an arbitrary nontrivial quasiorder\n<span>\\( \\rho \\)</span> is determined up to isomorphism or anti-isomorphism by the semigroup\n<span>\\( T_\\rho (X) \\)</span> of all isotone transformations of\n<span>\\( (X,\\rho ) \\)</span>, i.e., the transformations of\n<span>\\( X \\)</span> preserving\n<span>\\( \\rho \\)</span>. Subsequently, L.M. Popova proved a similar statement for the semigroup\n<span>\\( P_\\rho (X) \\)</span> of all partial isotone transformations of\n<span>\\( (X,\\rho ) \\)</span>; here the relation\n<span>\\( \\rho \\)</span> does not have to be a quasiorder but can be an arbitrary nontrivial reflexive\nor antireflexive binary relation on the set\n<span>\\( X \\)</span>. In the present paper, under the same constraints on the relation\n<span>\\( \\rho \\)</span>, we prove that the semigroup\n<span>\\( B_\\rho (X) \\)</span> of all isotone binary relations (set-valued mappings) of\n<span>\\( (X,\\rho ) \\)</span> determines\n<span>\\( \\rho \\)</span> up to an isomorphism or anti-isomorphism as well. In addition, for each of\nthe conditions\n<span>\\( T_\\rho (X)=T(X) \\)</span>,\n<span>\\( P_\\rho (X)=P(X) \\)</span>, and\n<span>\\( B_\\rho (X)=B(X) \\)</span>, we enumerate all\n<span>\\( n \\)</span>-ary relations\n<span>\\( \\rho \\)</span> satisfying the given condition.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"18 1","pages":"60 - 69"},"PeriodicalIF":0.5800,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S199047892401006X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0
Abstract
In 1961, L.M. Gluskin proved that a given set
\( X \) with an arbitrary nontrivial quasiorder
\( \rho \) is determined up to isomorphism or anti-isomorphism by the semigroup
\( T_\rho (X) \) of all isotone transformations of
\( (X,\rho ) \), i.e., the transformations of
\( X \) preserving
\( \rho \). Subsequently, L.M. Popova proved a similar statement for the semigroup
\( P_\rho (X) \) of all partial isotone transformations of
\( (X,\rho ) \); here the relation
\( \rho \) does not have to be a quasiorder but can be an arbitrary nontrivial reflexive
or antireflexive binary relation on the set
\( X \). In the present paper, under the same constraints on the relation
\( \rho \), we prove that the semigroup
\( B_\rho (X) \) of all isotone binary relations (set-valued mappings) of
\( (X,\rho ) \) determines
\( \rho \) up to an isomorphism or anti-isomorphism as well. In addition, for each of
the conditions
\( T_\rho (X)=T(X) \),
\( P_\rho (X)=P(X) \), and
\( B_\rho (X)=B(X) \), we enumerate all
\( n \)-ary relations
\( \rho \) satisfying the given condition.
期刊介绍:
Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.