共查询到19条相似文献,搜索用时 79 毫秒
1.
2.
3.
4.
5.
6.
本文主要研究了诺特赋值环上多项式理想的Grbner基的性质.利用Buchberger算法,证明了约化Grbner基的存在性及当其首项系数为单位元时的唯一性.推广了极小Grbner基和约化Grbner基的概念.同时,我们给出了求极小Grbner基和约化Grbner基的算法. 相似文献
7.
ZHOU Hong-tao 《数学杂志》2012,32(4)
本文主要研究了诺特赋值环上多项式理想的Gr(o)bner基的性质.利用Buchberger算法,证明了约化Gr(o)bner基的存在性及当其首项系数为单位元时的唯一性.推广了极小Gr(o)bner基和约化Gr(o)bner基的概念.同时,我们给出了求极小Gr(o)bner基和约化Gr(o)bner基的算法. 相似文献
8.
9.
10.
Gr?bner基算法是在计算机辅助设计和机器人学、信息安全等领域广泛应用的重要工具.文章在周梦和Winkler(2008)给出的差分-微分模上Gr?bner基算法和差分-微分维数多项式算法基础上,进一步研究了分别差分部分和微分部分的双变元维数多项式算法.在循环差分-微分模情形,构造和证明了利用差分-微分模上Gr?bner基计算双变元维数多项式的算法. 相似文献
11.
众所周知Gr\"obner基在很多领域都有着十分重要的应用.近些年来Gr\"obner基算法有了很大的改进,其中最著名的是Faug\`ere提出的F4和F5算法. 这两个算法具有很高的效率但通常需要消耗大量的内存.鉴于此,将给出一个布尔环上基于zdd数据结构的分支Gr\"obner基算法,该算法不仅可以大大降低对内存的消耗,还能有效的控制矩阵规模,从而提高算法的整体效率.详细阐述并证明了算法的基本理论,介绍该分支算法的数据结构及分支策略.最后通过实验数据可以发现,在很多例子中此算法都要优于Magma中的F4算法. 相似文献
12.
众所周知,计算广义旗流形G/K上不变爱因斯坦度量存在两个困难:(1)如何计算旗流形的非零结构常数;(2)如何计算旗流形爱因斯坦方程组的Grobner基.在这篇文章中用定理2.1来计算旗流形的非零结构常数,用Maple软件来计算旗流形爱因斯坦方程组的Gr?bnexr基.最后得到旗流形F_4/U~2(1)×SU(3),E_6/U~2(1)×SU(3)×SU(3),E_7/U~2(1)×SU(2)×SU(5),E_7/U~2(1)×SU(6),E_7/U~2(1)×SU(2)×SO(8)与E_8/U~2(1)×E_6上爱因斯坦度量. 相似文献
13.
Following the definition of Gr?bner bases in rings of differential operators given by Insa and Pauer (1998), we discuss some
computational properties of Gr?bner bases arising when the coefficient set is a ring. First we give examples to show that
the generalization of S-polynomials is necessary for computation of Gr?bner bases. Then we prove that under certain conditions
the G-S-polynomials can be reduced to be simpler than the original one. Especially for some simple case it is enough to consider
S-polynomials in the computation of Gr?bner bases. The algorithm for computation of Gr?bner bases can thus be simplified.
Last we discuss the elimination property of Gr?bner bases in rings of differential operators and give some examples of solving
PDE by elimination using Gr?bner bases.
This work was supported by the NSFC project 60473019. 相似文献
14.
Katsusuke Nabeshima 《Mathematics in Computer Science》2009,2(4):587-599
We propose a new notion of reduced Gr?bner bases in polynomial rings over a polynomial ring and we show that every ideal has
a unique reduced Gr?bner basis. We introduce an algorithm for computing them. 相似文献
15.
黄心中 《数学年刊A辑(中文版)》2014,35(4):413-422
研究平面拟共形映照的偏差函数μ(r),λ(K)和ηK(t).利用环形区域模函数的共形不变性,证明μ(r)满足一个新的不等式.作为应用,不必利用椭圆函数的性质,得到了估计Gr(o|¨)tzsch,Teichm(u|¨)ller和Mori这3种典型极值环形区域模函数的更精确的不等式,并得到了λ(K)和ηK(t)的更精确的上下界估计不等式.改进了由Anderson,Vamanamurthy,Qiu和Vuorinen所得的相应结果. 相似文献
16.
Grochenig and Balan, Casazza, Heil, and Landau introduced the concepts of localization. The concepts were used to Gabor frames, wavelet frames and sampling theorem in recent years. Here they are applied to the frame of exponential windows with the conclusion that the frame of exponential windows is a Banach frame for a kind of Banach spaces, and the conclusion is also obtained about the relationship between frame bounds, frame density, measure and density of indexing set. 相似文献
17.
18.
In this paper, we introduce a new algorithm for computing a set of generators for the syzygies on a sequence of polynomials. For this, we extend a given sequence of polynomials to a Gr?bner basis using Faugère??s F5 algorithm (A new efficient algorithm for computing Gr?bner bases without reduction to zero (F 5). ISSAC, ACM Press, pp 75?C83, 2002). We show then that if we keep all the reductions to zero during this computation, then at termination (by adding principal syzygies) we obtain a basis for the module of syzygies on the input polynomials. We have implemented our algorithm in the computer algebra system Magma, and we evaluate its performance via some examples. 相似文献