Classifying word problems of finitely generated algebras via computable reducibility

Valentino Delle Rose, L. Mauro, A. Sorbi
{"title":"Classifying word problems of finitely generated algebras via computable reducibility","authors":"Valentino Delle Rose, L. Mauro, A. Sorbi","doi":"10.1142/s0218196723500339","DOIUrl":null,"url":null,"abstract":"We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence relations (ceers), which has considerably grown in recent times. To pursue our analysis, we rely on the most popular way of assessing the complexity of ceers, that is via computable reducibility on equivalence relations, and its corresponding degree structure (the c-degrees). On the negative side, building on previous work of Kasymov and Khoussainov, we individuate a collection of c-degrees of ceers which cannot be realized by the word problem of any finitely generated algebra of finite type. On the positive side, we show that word problems of finitely generated semigroups realize a collection of c-degrees which embeds rich structures and is large in several reasonable ways.","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Algebra Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0218196723500339","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence relations (ceers), which has considerably grown in recent times. To pursue our analysis, we rely on the most popular way of assessing the complexity of ceers, that is via computable reducibility on equivalence relations, and its corresponding degree structure (the c-degrees). On the negative side, building on previous work of Kasymov and Khoussainov, we individuate a collection of c-degrees of ceers which cannot be realized by the word problem of any finitely generated algebra of finite type. On the positive side, we show that word problems of finitely generated semigroups realize a collection of c-degrees which embeds rich structures and is large in several reasonable ways.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用可计算约化性对有限生成代数的词问题进行分类
我们为最近的一个研究项目做出了贡献,该项目旨在通过可计算可数等价关系(ceers)理论的视角,重新审视词问题的复杂性研究,这是组合代数的一个主要研究领域,该理论在最近得到了相当大的发展。为了继续我们的分析,我们依赖于最流行的评估ceers复杂性的方法,即通过等价关系的可计算约约性及其相应的度结构(c度)。在消极方面,在Kasymov和Khoussainov之前的工作的基础上,我们对c度的集合进行了个体化,这些集合不能通过任何有限生成的有限类型代数的字问题来实现。在积极的方面,我们证明了有限生成半群的词问题实现了c度的集合,该集合以几种合理的方式嵌入了丰富的结构并且很大。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Super-biderivations on the planar Galilean conformal superalgebra On the induced partial action of a quotient group and a structure theorem for a partial Galois extension Semigroups locally embeddable into the class of finite semigroups Construction of symmetric cubic surfaces Properties of symbolic powers of edge ideals of weighted oriented graphs
×
引用
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