$$\varvec{S}$ -preclones and Galois connection $$\varvec{{}^{S}{}\textrm{Pol}}$ - $$\varvec{{}^{S}{}\textrm{Inv}}$, Part I

IF 0.6 4区 数学 Q3 MATHEMATICS Algebra Universalis Pub Date : 2024-07-09 DOI:10.1007/s00012-024-00863-7
Peter Jipsen, Erkko Lehtonen, Reinhard Pöschel
{"title":"$$\\varvec{S}$ -preclones and Galois connection $$\\varvec{{}^{S}{}\\textrm{Pol}}$ - $$\\varvec{{}^{S}{}\\textrm{Inv}}$, Part I","authors":"Peter Jipsen, Erkko Lehtonen, Reinhard Pöschel","doi":"10.1007/s00012-024-00863-7","DOIUrl":null,"url":null,"abstract":"<p>We consider <i>S</i>-<i>operations</i> <span>\\(f :A^{n} \\rightarrow A\\)</span> in which each argument is assigned a <i>signum</i> <span>\\(s \\in S\\)</span> representing a “property” such as being order-preserving or order-reversing with respect to a fixed partial order on <i>A</i>. The set <i>S</i> of such properties is assumed to have a monoid structure reflecting the behaviour of these properties under the composition of <i>S</i>-operations (e.g., order-reversing composed with order-reversing is order-preserving). The collection of all <i>S</i>-operations with prescribed properties for their signed arguments is not a clone (since it is not closed under arbitrary identification of arguments), but it is a preclone with special properties, which leads to the notion of <i>S</i>-<i>preclone</i>. We introduce <i>S</i>-<i>relations</i> <span>\\(\\varrho = (\\varrho _{s})_{s \\in S}\\)</span>, <i>S</i>-<i>relational clones</i>, and a preservation property (), and we consider the induced Galois connection <span>\\({}^{S}{}\\textrm{Pol}\\)</span>–<span>\\({}^{S}{}\\textrm{Inv}\\)</span>. The <i>S</i>-preclones and <i>S</i>-relational clones turn out to be exactly the closed sets of this Galois connection. We also establish some basic facts about the structure of the lattice of all <i>S</i>-preclones on <i>A</i>.</p>","PeriodicalId":50827,"journal":{"name":"Algebra Universalis","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"$$\\\\varvec{S}$$ -preclones and the Galois connection $$\\\\varvec{{}^{S}{}\\\\textrm{Pol}}$$ – $$\\\\varvec{{}^{S}{}\\\\textrm{Inv}}$$ , Part I\",\"authors\":\"Peter Jipsen, Erkko Lehtonen, Reinhard Pöschel\",\"doi\":\"10.1007/s00012-024-00863-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We consider <i>S</i>-<i>operations</i> <span>\\\\(f :A^{n} \\\\rightarrow A\\\\)</span> in which each argument is assigned a <i>signum</i> <span>\\\\(s \\\\in S\\\\)</span> representing a “property” such as being order-preserving or order-reversing with respect to a fixed partial order on <i>A</i>. The set <i>S</i> of such properties is assumed to have a monoid structure reflecting the behaviour of these properties under the composition of <i>S</i>-operations (e.g., order-reversing composed with order-reversing is order-preserving). The collection of all <i>S</i>-operations with prescribed properties for their signed arguments is not a clone (since it is not closed under arbitrary identification of arguments), but it is a preclone with special properties, which leads to the notion of <i>S</i>-<i>preclone</i>. We introduce <i>S</i>-<i>relations</i> <span>\\\\(\\\\varrho = (\\\\varrho _{s})_{s \\\\in S}\\\\)</span>, <i>S</i>-<i>relational clones</i>, and a preservation property (), and we consider the induced Galois connection <span>\\\\({}^{S}{}\\\\textrm{Pol}\\\\)</span>–<span>\\\\({}^{S}{}\\\\textrm{Inv}\\\\)</span>. The <i>S</i>-preclones and <i>S</i>-relational clones turn out to be exactly the closed sets of this Galois connection. We also establish some basic facts about the structure of the lattice of all <i>S</i>-preclones on <i>A</i>.</p>\",\"PeriodicalId\":50827,\"journal\":{\"name\":\"Algebra Universalis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algebra Universalis\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00012-024-00863-7\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra Universalis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00012-024-00863-7","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑 S 运算(f :A^{n} \rightarrow A\),其中每个参数都被赋予一个符号 \(s \in S\) 代表一个 "属性",比如相对于 A 上的一个固定偏序而言是保序的或者是逆序的。所有对其有符号参数具有规定属性的 S 操作的集合不是克隆(因为它在参数的任意标识下不封闭),但它是具有特殊属性的前克隆,这就引出了 S 前克隆的概念。我们引入了 S 关系 \(\varrho = (\varrho _{s})_{s \in S}\)、S 关系克隆和保存属性(),并考虑了诱导伽罗瓦连接 \({}^{S}{}textrm{Pol}\)-\({}^{S}{}textrm{Inv}\)。结果证明,S-前克隆和 S-关系克隆正是这种伽罗瓦连接的闭集。我们还建立了关于 A 上所有 S 前克隆的网格结构的一些基本事实。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
$$\varvec{S}$$ -preclones and the Galois connection $$\varvec{{}^{S}{}\textrm{Pol}}$$ – $$\varvec{{}^{S}{}\textrm{Inv}}$$ , Part I

We consider S-operations \(f :A^{n} \rightarrow A\) in which each argument is assigned a signum \(s \in S\) representing a “property” such as being order-preserving or order-reversing with respect to a fixed partial order on A. The set S of such properties is assumed to have a monoid structure reflecting the behaviour of these properties under the composition of S-operations (e.g., order-reversing composed with order-reversing is order-preserving). The collection of all S-operations with prescribed properties for their signed arguments is not a clone (since it is not closed under arbitrary identification of arguments), but it is a preclone with special properties, which leads to the notion of S-preclone. We introduce S-relations \(\varrho = (\varrho _{s})_{s \in S}\), S-relational clones, and a preservation property (), and we consider the induced Galois connection \({}^{S}{}\textrm{Pol}\)\({}^{S}{}\textrm{Inv}\). The S-preclones and S-relational clones turn out to be exactly the closed sets of this Galois connection. We also establish some basic facts about the structure of the lattice of all S-preclones on A.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Algebra Universalis
Algebra Universalis 数学-数学
CiteScore
1.00
自引率
16.70%
发文量
34
审稿时长
3 months
期刊介绍: Algebra Universalis publishes papers in universal algebra, lattice theory, and related fields. In a pragmatic way, one could define the areas of interest of the journal as the union of the areas of interest of the members of the Editorial Board. In addition to research papers, we are also interested in publishing high quality survey articles.
期刊最新文献
Odd and even Fibonacci lattices arising from a Garside monoid Cartesian closed varieties I: the classification theorem Natural dualities for varieties generated by finite positive MV-chains Quasivarieties of algebras whose compact relative congruences are principal Override and restricted union for partial functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1