Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation 2003
DOI: 10.1145/860854.860895
|View full text |Cite
|
Sign up to set email alerts
|

Plural

Abstract: Singular is a computer algebra system developed for efficient computations with polynomials. We describe Plural as an extension of Singular to noncommutative polynomial rings (G-/GR-algebras): to which structures does it apply, the prerequisites to monomial orderings, left-and two-sided Gröbner bases. The usual criteria to avoid "useless pairs" are revisited for their applicability in the case of G-/GRalgebras. Benchmark tests are used to evaluate the concepts compare them with other systems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 35 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…However, the above system is extremely symmetric and hence poses hard problems when we try to solve it this way (this was done in collaboration with V. Levandovskyy [9] with a non-commutative version of Singular [7]). …”
Section: Second Order Split Operatorsmentioning
confidence: 99%
“…However, the above system is extremely symmetric and hence poses hard problems when we try to solve it this way (this was done in collaboration with V. Levandovskyy [9] with a non-commutative version of Singular [7]). …”
Section: Second Order Split Operatorsmentioning
confidence: 99%