Standard bases and non-noetherianity: non-commutative polynomial rings
Proceedings of the 4th International Conference, AAECC-4 on Applicable algebra, error-correcting codes, combinatorics and computer algebra
An extension of Buchberger's algorithm and calculationsin enveloping fields of lie algebras
Journal of Symbolic Computation
Non-commutative Gröbner bases in algebras of solvable type
Journal of Symbolic Computation
Finite Gröbner bases in non-Noetherian skew polynomial rings
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Computing Gröbner bases in monoid and group rings
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
An algorithm for constructing Gro¨bner and free Schreier bases in free group algebras
Journal of Symbolic Computation
An introduction to commutative and noncommutative Gro¨bner bases
Selected papers of the second international colloquium on Words, languages and combinatorics
Journal of Symbolic Computation
Non-commmutative elimination in ore algebras proves multivariate identities
Journal of Symbolic Computation
Computational ideal theory in finitely generated extension rings
Theoretical Computer Science
Groebner Bases for Non-Commutative Polynomial Rings
AAECC-3 Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes
Groebner Bases in Non-Commutative Algebras
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Some Algorithmic Questions of Constructing Standard Bases
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Resolvent systems of difference polynomial ideals
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A characteristic set method for ordinary difference polynomial systems
Journal of Symbolic Computation
Skew polynomial rings, Gröbner bases and the letterplace embedding of the free associative algebra
Journal of Symbolic Computation
Gelfand-Kirillov dimensions of differential difference modules via Gröbner bases
ACM Communications in Computer Algebra
Hi-index | 0.00 |
In this paper we give an elimination algorithm for differential difference polynomial systems. We use the framework of a generalization of Ore algebras, where the independent variables are non-commutative. We prove that for certain term orderings, Buchberger's algorithm applied to differential difference systems terminates and produces a Gröbner basis. Therefore, differential-difference algebras provide a new instance of non-commutative graded rings which are effective Gröbner structures.