Ask Your Question
0

kernel of a matrix defined over polynomial rings

asked 2018-05-28 00:40:42 +0100

arpit gravatar image

updated 2019-08-26 20:59:52 +0100

FrédéricC gravatar image

I have a matrix defined as a function of variables in a polynomial ring defined over finite field as follows-

              Gr.<xp,yp>=LaurentPolynomialRing(GF(2));
              M=Matrix(Gr,[[xp-1,0],
                                 [yp-1,0],
                                 [0,(yp^(-1))-1],
                                 [0,-(xp^(-1))+1]]);

I want to calculate the kernel of this matrix but the kernel function

M.kernel()

gives an error. What am I doing wrong?

edit retag flag offensive close merge delete

1 Answer

Sort by » oldest newest most voted
1

answered 2018-05-28 03:43:10 +0100

nbruin gravatar image

You're not doing something wrong. You are just asking something that hasn't been implemented. As a workaround you can look at the kernel over the fraction field:

M.change_ring(Gr.fraction_field()).kernel()

From that you may be able to glean enough information on the kernel over your laurent polynomial ring. In general, modules over polynomial rings can get pretty involved.

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: 2018-05-28 00:40:42 +0100

Seen: 397 times

Last updated: May 28 '18