Ask Your Question
1

Ideals of non-commutative polynomials

asked 2013-01-27 13:23:38 -0500

Martin Brandenburg gravatar image

updated 2013-01-28 03:44:12 -0500

Basically I have the same question as here, but in the non-commutative case: Given non-commutative polynomials $f_1,\dotsc,f_s \in \mathbb{Q}\langle x_1,\dotsc,x_n \rangle$, how can I test (with sage, or any other program which can do this) that some $g \in \mathbb{Q}\langle x_1,\dotsc,x_n \rangle$ satisfies $g \in \langle f_1,\dotsc,f_s \rangle$ (two-sided ideal), and find an explicit linear combination $g = \sum_i a_i f_i b_i$ which demonstrates this?

In trac ticket #11068 non-commutative quotient rings were implemented. However, according to the reference manual on quotient rings, this assumes that one defines a reduce method by hand. But in my example , it is not clear how to do this.

edit retag flag offensive close merge delete

1 answer

Sort by ยป oldest newest most voted
1

answered 2013-10-18 08:19:35 -0500

Starx gravatar image

What you're asking for doesn't exist in complete generality because this would imply a solution to the word problem. The GAP package GBNP implements Grobner bases for non-commutative polynomial rings. The algorithm need not terminate, but when it does it solves the problem you're asking about.

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

Stats

Asked: 2013-01-27 13:23:38 -0500

Seen: 172 times

Last updated: Oct 18 '13