[2020-01-14]Groebner Bases: Universality, Parametricity and Canonicity

文章來源:  |  發布時間:2020-01-13  |  【打印】 【關閉

Title: Groebner Bases: Universality, Parametricity and Canonicity
Speaker: Prof. Deepak Kapur,University of New Mexico
Time: 10:00 a.m. 2020-01-14(Tuesday)
Venue: Lecture room (334),  Building 5, SKLCS, Institute of Software, CAS
Abstract: The talk will integrate the concepts of a universal Groebner basis which serves as a Groebner basis for all admissible term orderings, with parametric (more popularly called comprehensive) Groebner basis which serves as a Groebner basis for all possible specializations of parameters. Three different but related approaches will be presented. First one extends Kapur's algorithm for computing a parametric Groebner basis in which along with branching based on making the head coefficient nonzero or not, branching on ordering constraints is also done in order first to choose a term that could serve as the head term. The second one is based on the Kapur, Sun and Wang's algorithm for computing comprehensive Groebner basis and system but uses a reduced universal Groebner basis to generate a universal parametric Groebner basis. The third one starts with a reduced Groebner basis using one arbitrary ordering and then generate a universal comprehensive Groebner basis by incrementally changing the orderings along with partitioning specializations. The result of these algorithm is a mega Groebner basis that works for every admissible ordering as well as for any specialization of parameters.
斗牛牛游戏下载 北京十一选五遗漏爱彩乐 腾讯分分彩分析软件 福建东方6十1历史开奖码 理财产品保本收益高 宝新能源股票 新股申购一览表 广东十一选五体育彩票 龙湖配资 天津11选五预测工具 重庆时时全天在线计划软件