Suberesolving codes

IF 0.7 Q2 MATHEMATICS Tamkang Journal of Mathematics Pub Date : 2022-07-29 DOI:10.5556/j.tkjm.54.2023.4635
Somayyeh Jangjooye Shaldehi
{"title":"Suberesolving codes","authors":"Somayyeh Jangjooye Shaldehi","doi":"10.5556/j.tkjm.54.2023.4635","DOIUrl":null,"url":null,"abstract":"‎We show that any right continuing factor code with retract  0  into an irreducible shift of finite type is right eresolving‎, ‎and we give some sufficient conditions for a right eresolving almost everywhere code being right eresolving everywhere‎. ‎Suberesolving codes as a generalization of ersolving codes have been introduced and we determine some shift spaces which preserved by suberesolving codes‎. ‎Also‎, ‎we show that any bi-eresolving (resp‎. ‎bi-suberesolving) code on an irreducible shift of finite type (resp‎. ‎a synchronized system) is open (resp‎. ‎semi-open) and any right suberesolving code on a synchronized system is right continuing almost everywhere‎.","PeriodicalId":45776,"journal":{"name":"Tamkang Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tamkang Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5556/j.tkjm.54.2023.4635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

‎We show that any right continuing factor code with retract  0  into an irreducible shift of finite type is right eresolving‎, ‎and we give some sufficient conditions for a right eresolving almost everywhere code being right eresolving everywhere‎. ‎Suberesolving codes as a generalization of ersolving codes have been introduced and we determine some shift spaces which preserved by suberesolving codes‎. ‎Also‎, ‎we show that any bi-eresolving (resp‎. ‎bi-suberesolving) code on an irreducible shift of finite type (resp‎. ‎a synchronized system) is open (resp‎. ‎semi-open) and any right suberesolving code on a synchronized system is right continuing almost everywhere‎.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Suberesolving代码
证明了任何将0缩回为有限型不可约位移的右连因式码是右可解析的,并给出了右可解析几乎处处码是右可解析的一些充分条件。作为求解码的一种推广,引入了求解码,并确定了一些由求解码保留的移位空间。此外,我们还证明了任何双分辨(双分辨)的。有限型不可约移位上的双解析码。(一个同步的系统)是开放的(参见)。(半开放)并且同步系统上的任何右解析代码几乎在任何地方都是正确的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.50
自引率
0.00%
发文量
11
期刊介绍: To promote research interactions between local and overseas researchers, the Department has been publishing an international mathematics journal, the Tamkang Journal of Mathematics. The journal started as a biannual journal in 1970 and is devoted to high-quality original research papers in pure and applied mathematics. In 1985 it has become a quarterly journal. The four issues are out for distribution at the end of March, June, September and December. The articles published in Tamkang Journal of Mathematics cover diverse mathematical disciplines. Submission of papers comes from all over the world. All articles are subjected to peer review from an international pool of referees.
期刊最新文献
On the well-posedness and stability analysis of standing waves for a 1D-Benney-Roskes system An orthogonal class of $p$-Legendre polynomials on variable interval Approximating the fixed points of Suzuki's generalized non-expansive map via an efficient iterative scheme with an application Unique continuation property for the Rosenau equation A novel iterative algorithm for solving variational inequality, finite family of monotone inclusion and fixed point problems
×
引用
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