Lattices of retracts of direct products of two finite chains and notes on retracts of lattices

IF 0.6 4区 数学 Q3 MATHEMATICS Algebra Universalis Pub Date : 2022-08-02 DOI:10.1007/s00012-022-00788-z
Gábor Czédli
{"title":"Lattices of retracts of direct products of two finite chains and notes on retracts of lattices","authors":"Gábor Czédli","doi":"10.1007/s00012-022-00788-z","DOIUrl":null,"url":null,"abstract":"<div><p>Ordered by set inclusion, the <i>retracts</i> of a lattice <i>L</i> together with the empty set form a bounded poset <span>\\(Ret (L)\\)</span>. By a <i>grid</i> we mean the direct product of two non-singleton finite chains. We prove that if <i>G</i> is a grid, then <span>\\(Ret (G)\\)</span> is a lattice. We determine the number of elements of <span>\\(Ret (G)\\)</span>. Some easy properties of retracts, <i>retractions</i>, and their kernels called <i>retraction congruences</i> of (mainly distributive) lattices are found. Also, we present several examples, including a 12-element modular lattice <i>M</i> such that <span>\\(Ret (M)\\)</span> is not a lattice.</p></div>","PeriodicalId":50827,"journal":{"name":"Algebra Universalis","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra Universalis","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00012-022-00788-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

Abstract

Ordered by set inclusion, the retracts of a lattice L together with the empty set form a bounded poset \(Ret (L)\). By a grid we mean the direct product of two non-singleton finite chains. We prove that if G is a grid, then \(Ret (G)\) is a lattice. We determine the number of elements of \(Ret (G)\). Some easy properties of retracts, retractions, and their kernels called retraction congruences of (mainly distributive) lattices are found. Also, we present several examples, including a 12-element modular lattice M such that \(Ret (M)\) is not a lattice.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
两个有限链直积的回缩格及关于回缩格的注记
按照集合包含的顺序,格L的收缩与空集一起形成有界偏序集\(Ret(L)\)。我们所说的网格是指两个非单例有限链的直积。我们证明了如果G是一个网格,那么\(Ret(G)\)是一个格。我们确定\(Ret(G)\)的元素数。发现了回缩、回缩及其核的一些简单性质,称为(主要是分配的)格的回缩同余。此外,我们给出了几个例子,包括一个12元模格M,使得\(Ret(M)\)不是格。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Multisorted Boolean clones determined by binary relations up to minion homomorphisms Exploring new topologies for the theory of clones Graphs of finite algebras: edges, and connectivity Some remarks on type n lattice-ordered algebras and a question of Huijsmans Graphs of finite algebras: maximality, rectangularity, and decomposition
×
引用
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