{"title":"On pomonoid of partial transformations of a poset","authors":"Bana Al Subaiei","doi":"10.1515/math-2023-0161","DOIUrl":null,"url":null,"abstract":"The main objective of this article is to study the ordered partial transformations <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0161_eq_001.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi mathvariant=\"script\">PO</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>X</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{\\mathcal{PO}}\\left(X)</jats:tex-math> </jats:alternatives> </jats:inline-formula> of a poset <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0161_eq_002.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>X</m:mi> </m:math> <jats:tex-math>X</jats:tex-math> </jats:alternatives> </jats:inline-formula>. The findings show that the set of all partial transformations of a poset with a pointwise order is not necessarily a pomonoid. Some conditions are implemented to guarantee that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0161_eq_003.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi mathvariant=\"script\">PO</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>X</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{\\mathcal{PO}}\\left(X)</jats:tex-math> </jats:alternatives> </jats:inline-formula> is a pomonoid and this pomonoid is denoted by <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0161_eq_004.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msup> <m:mrow> <m:mi mathvariant=\"script\">PO</m:mi> </m:mrow> <m:mrow> <m:mi>↑</m:mi> </m:mrow> </m:msup> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>X</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{{\\mathcal{PO}}}^{\\uparrow }\\left(X)</jats:tex-math> </jats:alternatives> </jats:inline-formula>. Moreover, we determine the necessary conditions in order that the partial order-embedding transformations define the ordered version of the symmetric inverse monoid. The findings show that this set is an inverse pomonoid and we will denote it by <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0161_eq_005.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msup> <m:mrow> <m:mi mathvariant=\"script\">ℐPO</m:mi> </m:mrow> <m:mrow> <m:mi>↑</m:mi> </m:mrow> </m:msup> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>X</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{{\\mathcal{ {\\mathcal I} PO}}}^{\\uparrow }\\left(X)</jats:tex-math> </jats:alternatives> </jats:inline-formula>. In case the order on the poset <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0161_eq_006.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>X</m:mi> </m:math> <jats:tex-math>X</jats:tex-math> </jats:alternatives> </jats:inline-formula> is total, we explore some properties of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0161_eq_007.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msup> <m:mrow> <m:mi mathvariant=\"script\">PO</m:mi> </m:mrow> <m:mrow> <m:mi>↑</m:mi> </m:mrow> </m:msup> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>X</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{{\\mathcal{PO}}}^{\\uparrow }\\left(X)</jats:tex-math> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0161_eq_008.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msup> <m:mrow> <m:mi mathvariant=\"script\">ℐPO</m:mi> </m:mrow> <m:mrow> <m:mi>↑</m:mi> </m:mrow> </m:msup> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>X</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{{\\mathcal{ {\\mathcal I} PO}}}^{\\uparrow }\\left(X)</jats:tex-math> </jats:alternatives> </jats:inline-formula>, including regressive, unitary, and reversible.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/math-2023-0161","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
The main objective of this article is to study the ordered partial transformations PO(X){\mathcal{PO}}\left(X) of a poset XX. The findings show that the set of all partial transformations of a poset with a pointwise order is not necessarily a pomonoid. Some conditions are implemented to guarantee that PO(X){\mathcal{PO}}\left(X) is a pomonoid and this pomonoid is denoted by PO↑(X){{\mathcal{PO}}}^{\uparrow }\left(X). Moreover, we determine the necessary conditions in order that the partial order-embedding transformations define the ordered version of the symmetric inverse monoid. The findings show that this set is an inverse pomonoid and we will denote it by ℐPO↑(X){{\mathcal{ {\mathcal I} PO}}}^{\uparrow }\left(X). In case the order on the poset XX is total, we explore some properties of PO↑(X){{\mathcal{PO}}}^{\uparrow }\left(X) and ℐPO↑(X){{\mathcal{ {\mathcal I} PO}}}^{\uparrow }\left(X), including regressive, unitary, and reversible.
本文的主要目的是研究正集 X X 的有序部分变换 PO ( X ) {\mathcal{PO}}\left(X) 。研究结果表明,poset 的所有有序部分变换的集合并不一定是一个 pomonoid。我们提出了一些条件来保证 PO ( X ) {\mathcal{PO}}\left(X) 是一个 pomonoid,这个 pomonoid 用 PO ↑ ( X ) {{mathcal{PO}}^{\uparrow }\left(X) 表示。此外,我们还确定了一些必要条件,以使部分有序嵌入变换定义对称逆单元的有序版本。研究结果表明,这个集合是一个逆单元集,我们将用ℐPO ↑ ( X ) {{\mathcal{ {\mathcal I} PO}}^{\uparrow }\left(X) 来表示它。如果集合 X X 上的阶是全阶,我们将探讨 PO ↑ ( X ) {{\mathcal{PO}}^{\uparrow }/left(X)和ℐPO ↑ ( X ) {{\mathcal{ {\mathcal I} PO}}^{\uparrow }/left(X)的一些性质,包括回归性、单一性和可逆性。
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.