首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Insa and Pauer presented a basic theory of Grbner bases for differential operators with coefficients in a commutative ring and an improved version of this result was given by Ma et al.In this paper,we present an algorithmic approach for computing Grbner bases in difference-differential modules with coefficients in a commutative ring.We combine the generalized term order method of Zhou and Winkler with SPoly method of Insa and Pauer to deal with the problem.Our result is a generalization of theories of Insa and Pauer,Ma et al.,Zhou and Winkler and includes them as special cases.  相似文献   

2.
Faugère and Rahmany have presented the invariant F5 algorithm to compute SAGBI-Grbner bases of ideals of invariant rings. This algorithm has an incremental structure, and it is based on the matrix version of F5 algorithm to use F5 criterion to remove a part of useless reductions. Although this algorithm is more efficient than the Buchberger-like algorithm, however it does not use all the existing criteria (for an incremental structure) to detect superfluous reductions. In this paper, we consider a new algorithm, namely, invariant G2V algorithm, to compute SAGBI-Grbner bases of ideals of invariant rings using more criteria. This algorithm has a new structure and it is based on the G2V algorithm; a variant of the F5 algorithm to compute Grbner bases. We have implemented our new algorithm in Maple , and we give experimental comparison, via some examples, of performance of this algorithm with the invariant F5 algorithm.  相似文献   

3.
Insa and Pauer presented a basic theory of Grbner basis for differential operators with coeffcients in a commutative ring in 1998,and a criterion was proposed to determine if a set of differential operators is a Gro¨bner basis.In this paper,we will give a new criterion such that Insa and Pauer's criterion could be concluded as a special case and one could compute the Grbner basis more effciently by this new criterion.  相似文献   

4.
《中国科学:数学》2011,(6):I0001-I0004
On computing Grbner bases in rings of differential operators MA Xiao Dong,SUN Yao&WANG Ding Kang Abstract Insa and Pauer presented a basic theory of Gr¨obner basis for  相似文献   

5.
Rational Univariate Representation(RUR) of zero-dimensional ideals is used to describe the zeros of zero-dimensional ideals and RUR has been studied extensively.In 1999,Roullier proposed an efficient algorithm to compute RUR of zero-dimensional ideals.In this paper,we will present a new algorithm to compute Polynomial Univariate Representation(PUR) of zero-dimensional ideals.The new algorithm is based on some interesting properties of Grbner basis.The new algorithm also provides a method for testing separating elements.  相似文献   

6.
限制李超代数的诱导模   总被引:2,自引:0,他引:2  
刘文德 《东北数学》2005,21(1):54-60
In this paper we first prove the PBW theorem for reduced universal enveloping algebras of restricted Lie superalgebras. Then the notion of an induced module is introduced and the dimension formula of induced modules is established. Finally, using the results above, we obtain a property of induced modules pertaining to automorphisms of Lie superalgebras and isomorphisms of modules.  相似文献   

7.
Recently, Takahashi established a new approximation theory for finitely generated modules over commutative Noetherian rings, which unifies the spherical approximation theorem due to Auslander and Bridger and the Cohen-Macaulay approximation theorem due to Auslander and Buchweitz. In this paper we generalize these results to much more general case over non-commutative rings. As an application, we establish a relation between the injective dimension of a generalized tilting module ω and the finitistic dimension with respect to ω.  相似文献   

8.
In this paper, we study the homogenous quotient modules of the Hardy module on the bidisk. The essential normality of the homogenous quotient modules is completely characterized. We also describe the essential spectrum for a general quotient module. The paper also considers K-homology invariant defined in the case of the homogenous quotient modules on the bidisk.  相似文献   

9.
The main objective of this paper is to study the dimension trees and further the homological dimensions of the extension algebras — dual and trivially twisted extensions — with a unified combinatorial approach using the two combinatorial algorithms — Topdown and Bottomup. We first present a more complete and clearer picture of a dimension tree, with which we are then able, on the one hand, to sharpen some results obtained before and furthermore reveal a few more hidden subtle homological phenomenons of or connections between the involved algebras; on the other hand, to provide two more efficient combinatorial algorithms for computing dimension trees, and consequently the homological dimensions as an application. We believe that the more refined complete structural information on dimension trees will be useful to study other homological properties of this class of extension algebras.  相似文献   

10.
Applying the theory of Grbner basis to the Schubert presentation for the cohomology of Grassmannians [2], we extend the homology rigidity results known for the classical Grassmanians to the exceptional cases.  相似文献   

11.
关于有理模和余理想子代数的性质   总被引:1,自引:0,他引:1  
张良云 《东北数学》2000,16(3):265-271
In this paper, for some used conceptions and notations, we see [1] and [2].§1. Rational Module and Its Exact Sequence In [1], Cai Chuanreng and Cheng Huixiang have proved that relative Hopf modules and rational modules are one by one corresponding. In [2], Zhang Liangyun has given the dual relationship between relative Hopf modules. Naturally, we have a question to ask: is the dual module of a rational module still a rational module? This answer is affirmative. Let H be a Hopf …  相似文献   

12.
In this paper,a characterization of continuous module homomorphisms on random seminormed modules is first given;then the characterization is further used to show that the Hahn-Banach type of extension theorem is still true for continuous module homomorphisms on random semi-normed modules.  相似文献   

13.
A unitary right R-module MR satisfies acc on d-annihilators if for every sequence(a_n)_n of elements of R the ascending chain AnnM(a_1)■ AnnM(a_1 a_2)■AnnM(a_1 a_2 a_3)■… of submodules of MR stabilizes. In this paper we first investigate some triangular matrix extensions of modules with acc on d-annihilators. Then we show that under some additional conditions,the Ore extension module M[x]R[x;α,δ]over the Ore extension ring R[x;α,δ] satisfies acc on d-annihilators if and only if the module MR satisfies acc on d-annihilators. Consequently, several known results regarding modules with acc on d-annihilators are extended to a more general setting.  相似文献   

14.
Considering steady state bifurcation of single parameter r-equivariant systemswhere Γ is a compact Lie group acting on X via a faithful orthogonal representation, we simultaneously block-diagonalise all jacobians of g along a solution path with respect to symmetry adapted subspaces and apply bifurcation groups to reduce symmetry breaking bifurcation points to simple bifurcation points. In generical situations this algorithm allows for numerically stable use of continuation methods and steady state bifurcation point detection and computation. The large scale decrease of computing efforts is demonstrated at computing the equilibria of a hexagonal lattice dome with 21 degrees of freedom, we present a great variety of solution arcs with symmetry from full D6 down to Z2 symmetry.  相似文献   

15.
An n × n ω-circulant matrix which has a specific structure is a type of important matrix. Several norm equalities and inequalities are proved for ω-circulant operator matrices with ω = e~(iθ)(0≤θ 2π) in this paper. We give the special cases for norm equalities and inequalities, such as the usual operator norm and the Schatten p-norms. Pinching type inequality is also proposed for weakly unitarily invariant norms. Meanwhile,we present that the set of ω-circulant matrices with complex entries has an idempotent basis. Based on this basis, we introduce an automorphism on the ω-circulant algebra and then show different operators on linear vector space that are isomorphic to the ω-circulant algebra. The function properties, other idempotent bases and a linear involution are discussed for ω-circulant algebra. These results are closely related to the special structure of ω-circulant matrices.  相似文献   

16.
Chu Li-zhong 《东北数学》2010,26(3):230-238
Let (R, m) be a commutative Noetherian local ring, I an ideal of R and M a finitely generated R-module. Let limnHm^i(M/I^nM)be the ith formal local cohomology module of M with respect to I.In this paper, we discuss some properties of formal local cohomology modules limnHm^i(M/I^nM),which are analogous to the finiteness and Artinianness of local cohomology modules of a finitely generated module.  相似文献   

17.
In this paper, we explore some issues related to adopting the Adomian decomposition method (ADM) to solve partial differential equations (PDEs), par-ticularly linear diffusion equations. Through a proposition, we show that extending the ADM from ODEs to PDEs poses some strong requirements on the initial and boundary conditions, which quite often are violated for problems encountered in en-gineering, physics and applied mathematics. We then propose a modified approach, based on combining the ADM with the Fourier series decomposition, to provide solu-tions for those problems when these conditions are not met. In passing, we shall also present an argument that would address a long-term standing“pitfall”of the original ADM and make this powerful approach much more rigorous in its setup. Numeri-cal examples are provided to show that our modified approach can be used to solve any linear diffusion equation (homogeneous or non-homogeneous), with reasonable smoothness of the initial and boundary data.  相似文献   

18.
The singular value decomposition problem is mathematically equivalent to the eigenproblem of an argumented matrix. Golub et al. give a bidiagonalization Lanczos method for computing a number of largest or smallest singular values and corresponding singular vertors, but the method may encounter some convergence problems. In this paper we analyse the convergence of the method and show why it may fail to converge. To correct this possible nonconvergence, we propose a refined bidiagonalization Lanczos method and apply the implicitly restarting technique to it, and we then present an implicitly restarted bidiagonalization Lanczos algorithm(IRBL) and an implicitly restarted refined bidiagonalization Lanczos algorithm (IRRBL). A new implicitly restarting scheme and a reliable and efficient algorithm for computing refined shifts are developed for this special structure eigenproblem.Theoretical analysis and numerical experiments show that IRRBL performs much better than IRBL.  相似文献   

19.
Given a suitable ordering of the positive root system associated with a semisimple Lie algebra,there exists a natural correspondence between Verma modules and related polynomial algebras. With this, the Lie algebra action on a Verma module can be interpreted as a differential operator action on polynomials, and thus on the corresponding truncated formal power series. We prove that the space of truncated formal power series gives a differential-operator representation of the Weyl group W. We also introduce a system of partial differential equations to investigate singular vectors in the Verma module. It is shown that the solution space of the system in the space of truncated formal power series is the span of {w(1) | w ∈ W }. Those w(1) that are polynomials correspond to singular vectors in the Verma module. This elementary approach by partial differential equations also gives a new proof of the well-known BGG-Verma theorem.  相似文献   

20.
Manufacturing network flow (MNF) is a generalized network model that overcomes the limitation of an ordinary network flow in modeling more complicated manufacturing scenarios, in particular the synthesis of different materials into one product and/or the distilling of one type of material into many different products. Though a network simplex method for solving a simplified version of MNF has been outlined in the literature, more research work is still needed to give a complete answer whether some classical duality and optimality results of the classical network flow problem can be extended in MNF. In this paper, we propose an algorithmic method for obtaining an initial basic feasible solution to start the existing network simplex algorithm, and present a network-based approach to checking the dual feasibility conditions. These results are an extension of those of the ordinary network flow problem.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号