Plural, a non-commutative extension of singular: past, present and future

Authors:
Viktor Levandovskyy
Affiliations:
Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Austria
Venue:
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Year:
2006

Citing 10
Cited 2

Non-commutative Gröbner bases in algebras of solvable type

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
Non-commmutative elimination in ore algebras proves multivariate identities

Journal of Symbolic Computation
Groebner Bases in Non-Commutative Algebras

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Opal: A System for Computing Noncommutative Gröbner Bases

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Plural: a computer algebra system for noncommutative polynomial algebras

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Intersection of ideals with non-commutative subalgebras

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Tangent cone algorithm for homogenized differential operators

Journal of Symbolic Computation
Gröbner bases and syzygies on bimodules over PBW algebras

Journal of Symbolic Computation
Grbner Deformations of Hypergeometric Differential Equations

Grbner Deformations of Hypergeometric Differential Equations

An automated confluence proof for an infinite rewrite system parametrized over an integro-differential algebra

ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Exact linear modeling with polynomial coefficients

Multidimensional Systems and Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe the non–commutative extension of the computer algebra system Singular, called Plural. In the system, we provide rich functionality for symbolic computation within a wide class of non–commutative algebras. We discuss the computational objects of Plural, the implementation of main algorithms, various aspects of software engineering and numerous applications.