{"title":"通过符号计算发现多个多对数方程","authors":"Andrei Matveiakin","doi":"10.1145/3511528.3511539","DOIUrl":null,"url":null,"abstract":"We discuss how symbolic computations can be used to find functional equations for multiple polylogarithms and prove parts of Goncharov's depth conjecture. We present a custom-built C++ toolkit for polylogarithm symbol manipulations in Lie coalgebras and show how this approach compares favorably to the alternatives in terms of performance.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"55 1","pages":"112 - 116"},"PeriodicalIF":0.4000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Discovering multiple polylogarithm equations via symbolic computations\",\"authors\":\"Andrei Matveiakin\",\"doi\":\"10.1145/3511528.3511539\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We discuss how symbolic computations can be used to find functional equations for multiple polylogarithms and prove parts of Goncharov's depth conjecture. We present a custom-built C++ toolkit for polylogarithm symbol manipulations in Lie coalgebras and show how this approach compares favorably to the alternatives in terms of performance.\",\"PeriodicalId\":41965,\"journal\":{\"name\":\"ACM Communications in Computer Algebra\",\"volume\":\"55 1\",\"pages\":\"112 - 116\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Communications in Computer Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3511528.3511539\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Communications in Computer Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3511528.3511539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Discovering multiple polylogarithm equations via symbolic computations
We discuss how symbolic computations can be used to find functional equations for multiple polylogarithms and prove parts of Goncharov's depth conjecture. We present a custom-built C++ toolkit for polylogarithm symbol manipulations in Lie coalgebras and show how this approach compares favorably to the alternatives in terms of performance.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
