用复数子变格生成品种的最小单体

Pub Date : 2024-03-22 DOI:10.1017/s0013091524000178
Sergey V. Gusev
{"title":"用复数子变格生成品种的最小单体","authors":"Sergey V. Gusev","doi":"10.1017/s0013091524000178","DOIUrl":null,"url":null,"abstract":"A variety is <jats:italic>finitely universal</jats:italic> if its lattice of subvarieties contains an isomorphic copy of every finite lattice. We show that the 6-element Brandt monoid generates a finitely universal variety of monoids and, by the previous results, it is the smallest generator for a monoid variety with this property. It is also deduced that the join of two Cross varieties of monoids can be finitely universal. In particular, we exhibit a finitely universal variety of monoids with uncountably many subvarieties which is the join of two Cross varieties of monoids whose lattices of subvarieties are the 6-element and the 7-element chains, respectively.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimal monoids generating varieties with complex subvariety lattices\",\"authors\":\"Sergey V. Gusev\",\"doi\":\"10.1017/s0013091524000178\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A variety is <jats:italic>finitely universal</jats:italic> if its lattice of subvarieties contains an isomorphic copy of every finite lattice. We show that the 6-element Brandt monoid generates a finitely universal variety of monoids and, by the previous results, it is the smallest generator for a monoid variety with this property. It is also deduced that the join of two Cross varieties of monoids can be finitely universal. In particular, we exhibit a finitely universal variety of monoids with uncountably many subvarieties which is the join of two Cross varieties of monoids whose lattices of subvarieties are the 6-element and the 7-element chains, respectively.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/s0013091524000178\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/s0013091524000178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如果一个品种的子变格包含每个有限变格的同构副本,那么这个品种就是有限通用的。我们证明了由 6 个元素组成的勃兰特一元体生成了一个有限普遍的一元体综类,而且根据前面的结果,它是具有这一性质的一元体综类的最小生成器。此外,我们还推导出,两个十字单元杂交的连接可以是有限通用的。特别是,我们展示了一个具有不可计数子域的有限普遍的单元杂交,它是两个交叉单元杂交的连接,而这两个交叉单元杂交的子域网格分别是 6 元链和 7 元链。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
Minimal monoids generating varieties with complex subvariety lattices
A variety is finitely universal if its lattice of subvarieties contains an isomorphic copy of every finite lattice. We show that the 6-element Brandt monoid generates a finitely universal variety of monoids and, by the previous results, it is the smallest generator for a monoid variety with this property. It is also deduced that the join of two Cross varieties of monoids can be finitely universal. In particular, we exhibit a finitely universal variety of monoids with uncountably many subvarieties which is the join of two Cross varieties of monoids whose lattices of subvarieties are the 6-element and the 7-element chains, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
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