有限全变换半群变体的最大正则子半群的协整性

IF 0.8 2区 数学 Q2 MATHEMATICS
{"title":"有限全变换半群变体的最大正则子半群的协整性","authors":"","doi":"10.1016/j.jalgebra.2024.08.017","DOIUrl":null,"url":null,"abstract":"<div><p>Let <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow></msub></math></span> be the full transformation monoid over a finite set <em>X</em>, and fix some <span><math><mi>a</mi><mo>∈</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow></msub></math></span> of rank <em>r</em>. The variant <span><math><msubsup><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow><mrow><mi>a</mi></mrow></msubsup></math></span> has underlying set <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow></msub></math></span>, and operation <span><math><mi>f</mi><mo>⋆</mo><mi>g</mi><mo>=</mo><mi>f</mi><mi>a</mi><mi>g</mi></math></span>. We study the congruences of the subsemigroup <span><math><mi>P</mi><mo>=</mo><mi>Reg</mi><mo>(</mo><msubsup><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow><mrow><mi>a</mi></mrow></msubsup><mo>)</mo></math></span> consisting of all regular elements of <span><math><msubsup><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow><mrow><mi>a</mi></mrow></msubsup></math></span>, and the lattice <span><math><mi>Cong</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> of all such congruences. Our main structure theorem ultimately decomposes <span><math><mi>Cong</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> as a specific subdirect product of <span><math><mi>Cong</mi><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>)</mo></math></span>, and the full equivalence relation lattices of certain combinatorial systems of subsets and partitions. We use this to give an explicit classification of the congruences themselves, and we also give a formula for the height of the lattice.</p></div>","PeriodicalId":14888,"journal":{"name":"Journal of Algebra","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S002186932400471X/pdfft?md5=f300186c5fdab6c0805d1ebb60eb60b0&pid=1-s2.0-S002186932400471X-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Congruences of maximum regular subsemigroups of variants of finite full transformation semigroups\",\"authors\":\"\",\"doi\":\"10.1016/j.jalgebra.2024.08.017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Let <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow></msub></math></span> be the full transformation monoid over a finite set <em>X</em>, and fix some <span><math><mi>a</mi><mo>∈</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow></msub></math></span> of rank <em>r</em>. The variant <span><math><msubsup><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow><mrow><mi>a</mi></mrow></msubsup></math></span> has underlying set <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow></msub></math></span>, and operation <span><math><mi>f</mi><mo>⋆</mo><mi>g</mi><mo>=</mo><mi>f</mi><mi>a</mi><mi>g</mi></math></span>. We study the congruences of the subsemigroup <span><math><mi>P</mi><mo>=</mo><mi>Reg</mi><mo>(</mo><msubsup><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow><mrow><mi>a</mi></mrow></msubsup><mo>)</mo></math></span> consisting of all regular elements of <span><math><msubsup><mrow><mi>T</mi></mrow><mrow><mi>X</mi></mrow><mrow><mi>a</mi></mrow></msubsup></math></span>, and the lattice <span><math><mi>Cong</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> of all such congruences. Our main structure theorem ultimately decomposes <span><math><mi>Cong</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> as a specific subdirect product of <span><math><mi>Cong</mi><mo>(</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>)</mo></math></span>, and the full equivalence relation lattices of certain combinatorial systems of subsets and partitions. We use this to give an explicit classification of the congruences themselves, and we also give a formula for the height of the lattice.</p></div>\",\"PeriodicalId\":14888,\"journal\":{\"name\":\"Journal of Algebra\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S002186932400471X/pdfft?md5=f300186c5fdab6c0805d1ebb60eb60b0&pid=1-s2.0-S002186932400471X-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebra\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S002186932400471X\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebra","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S002186932400471X","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

让 TX 是有限集 X 上的全变换单元,并固定某个秩为 r 的 a∈TX。变体 TXa 的底集是 TX,运算 f⋆g=fag 是 TXa。我们研究由 TXa 的所有正则元素组成的子半群 P=Reg(TXa) 的同余式,以及所有此类同余式的网格 Cong(P)。我们的主要结构定理最终将 Cong(P) 分解为 Cong(Tr) 的特定子直积,以及某些子集和分区组合系统的全等价关系网格。我们借此给出了全等关系本身的明确分类,还给出了网格高度的公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Congruences of maximum regular subsemigroups of variants of finite full transformation semigroups

Let TX be the full transformation monoid over a finite set X, and fix some aTX of rank r. The variant TXa has underlying set TX, and operation fg=fag. We study the congruences of the subsemigroup P=Reg(TXa) consisting of all regular elements of TXa, and the lattice Cong(P) of all such congruences. Our main structure theorem ultimately decomposes Cong(P) as a specific subdirect product of Cong(Tr), and the full equivalence relation lattices of certain combinatorial systems of subsets and partitions. We use this to give an explicit classification of the congruences themselves, and we also give a formula for the height of the lattice.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Algebra
Journal of Algebra 数学-数学
CiteScore
1.50
自引率
22.20%
发文量
414
审稿时长
2-4 weeks
期刊介绍: The Journal of Algebra is a leading international journal and publishes papers that demonstrate high quality research results in algebra and related computational aspects. Only the very best and most interesting papers are to be considered for publication in the journal. With this in mind, it is important that the contribution offer a substantial result that will have a lasting effect upon the field. The journal also seeks work that presents innovative techniques that offer promising results for future research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信