Back to Forum | View unanswered posts | View active topics





Post a reply
Username:
Note:If not registered, provide any username. For more comfort, register here.
Subject:
Message body:
Enter your message here, it may contain no more than 60000 characters. 

Smilies
:D :) :( :o :shock: :? 8) :lol: :x :P :oops: :cry: :evil: :twisted: :roll: :wink: :!: :?: :idea: :arrow: :| :mrgreen:
Font size:
Font colour
Options:
BBCode is ON
[img] is ON
[flash] is OFF
[url] is ON
Smilies are ON
Disable BBCode
Disable smilies
Do not automatically parse URLs
Confirmation of post
To prevent automated posts the board requires you to enter a confirmation code. The code is displayed in the image you should see below. If you are visually impaired or cannot otherwise read this code please contact the %sBoard Administrator%s.
Confirmation code:
Enter the code exactly as it appears. All letters are case insensitive, there is no zero.
   

Topic review - linear algebra on polynomials
Author Message
pasechnik
  Post subject:  linear algebra on polynomials  Reply with quote
is there an obvious way to solve the following (easy) problem in Singular:
given a finite-dimensional subspace S of homogeneous polynomials over a field F, determine whether a given polynomial g is contained in S, and, if yes, to provide an expression in generators of S. (S is given by a list f_1,..,f_k of polynomials that generate it.)

Obviously, Singular can compute whether g is contained in the ideal (f_1,...f_k), but
here the problem is easier, and can be solved by building and solving a system of linear
equations.
So my question is how to avoid coding this myself (something that requires bookeeping of monomials present in f_i's, etc etc).

Thanks,
Dmitrii
Post Posted: Tue Dec 19, 2006 7:09 pm


It is currently Fri May 13, 2022 10:56 am
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group