[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.
新浪爱彩-正好彩票 新浪爱彩-正好彩票 UU快3-正好彩票 天天乐棋牌-正好彩票 网上电玩-正好彩票 内蒙古快三-正好彩票 抢庄牛牛-正好彩票 江苏福彩 万人牛牛-正好彩票 360彩票网-正好彩票 彩票网购-正好彩票 网易彩票-正好彩票 江苏福彩网 澳门游戏平台注册网站