代数长度为3的拟正4辫的算法识别

IF 0.1 Q4 MATHEMATICS

Groups Complexity Cryptology Pub Date : 2015-04-24 DOI:10.1515/gcc-2015-0012

S. Orevkov

{"title":"代数长度为3的拟正4辫的算法识别","authors":"S. Orevkov","doi":"10.1515/gcc-2015-0012","DOIUrl":null,"url":null,"abstract":"Abstract We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We give also a polynomial algorithm to decide if a given braid with any number of strings is a product of two factors which are conjugates of given powers of the standard generators (in my previous paper this problem was solved without polynomial estimates).","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"26 1","pages":"157 - 173"},"PeriodicalIF":0.1000,"publicationDate":"2015-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Algorithmic recognition of quasipositive 4-braids of algebraic length three\",\"authors\":\"S. Orevkov\",\"doi\":\"10.1515/gcc-2015-0012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We give also a polynomial algorithm to decide if a given braid with any number of strings is a product of two factors which are conjugates of given powers of the standard generators (in my previous paper this problem was solved without polynomial estimates).\",\"PeriodicalId\":41862,\"journal\":{\"name\":\"Groups Complexity Cryptology\",\"volume\":\"26 1\",\"pages\":\"157 - 173\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2015-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2015-0012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2015-0012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 3

摘要

摘要给出了一种判定给定的四串编织是否是编织群标准生成子共轭的三个因子乘积的算法。该算法是多项式时间的。它基于Garside理论。我们还给出了一个多项式算法来确定给定的任意数量的字符串的辫是否是两个因子的乘积，这两个因子是标准生成器的给定幂的共轭(在我之前的论文中，这个问题没有多项式估计就解决了)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Algorithmic recognition of quasipositive 4-braids of algebraic length three

Abstract We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We give also a polynomial algorithm to decide if a given braid with any number of strings is a product of two factors which are conjugates of given powers of the standard generators (in my previous paper this problem was solved without polynomial estimates).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Groups Complexity Cryptology MATHEMATICS-

CiteScore

1.10

自引率

0.00%

发文量