[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.
爱玩棋牌官方网站下载安装 河南今天11选5走势图 四人麻将游戏单机版下载 pc蛋蛋软件 重庆快乐10分平台 广西11选5在哪里可以玩 重庆时时开彩结果历史 手机麻将游戏排名前十 国标麻将能吃吗 超级大乐透玩法图解 云南快乐10分遗漏数据 河南快3直播计划 大众麻将规则 简单的赚钱软件 豪门国际注册送38网址 13317期排列5晚秋分析 东北麻将玩法