2003
DOI: 10.1145/990353.990363
|View full text |Cite
|
Sign up to set email alerts
|

Using computer algebra system SINGULAR:PLURAL for computations in noncommutative polynomial algebras

Abstract: We give a detailed account of algorithms and applications provided with SINGULAR:PLURAL (we call it PLURAL for short). The poster is done in form of (big) one-page introduction to the capabilities of the system.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
56
0
1

Year Published

2005
2005
2023
2023

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 29 publications
(61 citation statements)
references
References 4 publications
1
56
0
1
Order By: Relevance
“…As far as we know, Singular:Plural is the only modern system allowing user to do such combined computations. Main computational objects in the system are GR-algebras, where we can compute Gröbner bases for left and two-sided ideals and for left modules, modules of syzygies, free resolutions, intersections with subalgebras and many more (see [21] or [22] for description of all these algorithms). We put a lot of efforts in implementing the algorithms as efficient as possible and the latest tests indicate that the performance of Singular:Plural is quite good.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…As far as we know, Singular:Plural is the only modern system allowing user to do such combined computations. Main computational objects in the system are GR-algebras, where we can compute Gröbner bases for left and two-sided ideals and for left modules, modules of syzygies, free resolutions, intersections with subalgebras and many more (see [21] or [22] for description of all these algorithms). We put a lot of efforts in implementing the algorithms as efficient as possible and the latest tests indicate that the performance of Singular:Plural is quite good.…”
Section: Discussionmentioning
confidence: 99%
“…We put a lot of efforts in implementing the algorithms as efficient as possible and the latest tests indicate that the performance of Singular:Plural is quite good. You can find detailed information on Singular:Plural either in [22] or at http://www.singular.uni-kl.de/plural.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…As described in [6], a general multiplication in a non-commutative G-algebra boils down to the multiplication of y m · x n for a couple of variables x, y such that x a y b is a standard word. In general, the polynomial y m · x n involves other variables as well, but the case, when x, y generate a subalgebra of the type A(q, α, β, γ), appears often enough.…”
Section: Application In Computer Algebra Implementationmentioning
confidence: 99%
“…In [6] it has been proposed to address each pair of non-commuting and nonq-commuting variables separately. To each such pair a matrix M is assigned, such that M ij = y i · x j is a polynomial, written in terms of standard monomials.…”
Section: Application In Computer Algebra Implementationmentioning
confidence: 99%