Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++

Mariusz Felisiak, D. Simson
{"title":"Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++","authors":"Mariusz Felisiak, D. Simson","doi":"10.1109/SYNASC.2011.41","DOIUrl":null,"url":null,"abstract":"We show that the reduced mesh root systems and mesh geometries of roots for each of the simply-laced Dynkin diagrams can be classified by applying symbolic computer algebra computations and numeric algorithmic computations in Maple, C++ and Linux. Results of our computing experiences are presented in a table of Section 2 and in Section 6.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2011.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

We show that the reduced mesh root systems and mesh geometries of roots for each of the simply-laced Dynkin diagrams can be classified by applying symbolic computer algebra computations and numeric algorithmic computations in Maple, C++ and Linux. Results of our computing experiences are presented in a table of Section 2 and in Section 6.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用Maple和c++计算动态图网格根系统的经验
通过在Maple、c++和Linux中应用符号计算机代数计算和数值算法计算,我们可以对每个简单排列的Dynkin图的简化网格根系统和网格根几何进行分类。我们计算经验的结果显示在第2节和第6节的表格中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition A Data Dissemination Algorithm for Opportunistic Networks A Probabilistic Model-Free Approach in Learning Multivariate Noisy Linear Systems Probabilistic Approach for Automated Reasoning for Lane Identification in Intelligent Vehicles Intelligent Web-History Based on a Hybrid Clustering Algorithm for Future-Internet Systems
×
引用
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