关于循环图的部分等距的幺一元

IF 0.8 4区 数学 Q2 MATHEMATICS
VITOR H. FERNANDES, TANIA PAULISTA
{"title":"关于循环图的部分等距的幺一元","authors":"VITOR H. FERNANDES, TANIA PAULISTA","doi":"10.55730/1300-0098.3460","DOIUrl":null,"url":null,"abstract":"In this paper we consider the monoid $DPC_n$ of all partial isometries of an $n$-cycle graph $C_n$. We show that $DPC_n$ is the submonoid of the monoid of all oriented partial permutations on an $n$-chain whose elements are precisely all restrictions of a dihedral group of order $2n$. Our main aim is to exhibit a presentation of $DPC_n$. We also describe Green's relations of $DPC_n$ and calculate its cardinality and rank.","PeriodicalId":51206,"journal":{"name":"Turkish Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On the monoid of partial isometries of a cycle graph\",\"authors\":\"VITOR H. FERNANDES, TANIA PAULISTA\",\"doi\":\"10.55730/1300-0098.3460\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the monoid $DPC_n$ of all partial isometries of an $n$-cycle graph $C_n$. We show that $DPC_n$ is the submonoid of the monoid of all oriented partial permutations on an $n$-chain whose elements are precisely all restrictions of a dihedral group of order $2n$. Our main aim is to exhibit a presentation of $DPC_n$. We also describe Green's relations of $DPC_n$ and calculate its cardinality and rank.\",\"PeriodicalId\":51206,\"journal\":{\"name\":\"Turkish Journal of Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2023-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Turkish Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.55730/1300-0098.3460\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Turkish Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55730/1300-0098.3460","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 4

摘要

本文研究了一个$n$-环图$C_n$的所有部分等距的一元$DPC_n$。我们证明了$DPC_n$是$n$链上的所有定向部分置换的monooid的子monooid,该链的元素恰好是$2n$阶二面体群的所有限制。我们的主要目的是展示$DPC_n$的表示。我们还描述了$DPC_n$的Green关系,并计算了它的基数和秩。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the monoid of partial isometries of a cycle graph
In this paper we consider the monoid $DPC_n$ of all partial isometries of an $n$-cycle graph $C_n$. We show that $DPC_n$ is the submonoid of the monoid of all oriented partial permutations on an $n$-chain whose elements are precisely all restrictions of a dihedral group of order $2n$. Our main aim is to exhibit a presentation of $DPC_n$. We also describe Green's relations of $DPC_n$ and calculate its cardinality and rank.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.80
自引率
10.00%
发文量
161
审稿时长
6-12 weeks
期刊介绍: The Turkish Journal of Mathematics is published electronically 6 times a year by the Scientific and Technological Research Council of Turkey (TÜBİTAK) and accepts English-language original research manuscripts in the field of mathematics. Contribution is open to researchers of all nationalities.
×
引用
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学术官方微信