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 - Find how Groebner basis is constructed from polynomials
Author Message
  Post subject:  Re: Find how Groebner basis is constructed from polynomials  Reply with quote
I tried the lift function and it works. Thank you very much.
Post Posted: Mon Sep 05, 2016 2:26 am
  Post subject:  Re: Find how Groebner basis is constructed from polynomials  Reply with quote
lift does this
http://www.singular.uni-kl.de/Manual/4-0-3/sing_334.htm
resp. liftstd
http://www.singular.uni-kl.de/Manual/4-0-3/sing_335.htm
Post Posted: Sat Sep 03, 2016 7:02 pm
  Post subject:  Find how Groebner basis is constructed from polynomials  Reply with quote
Suppose there is a set I = {i1, i2, …, in} of polynomials and a Groebner basis J = {j1, j2, …, jm} of I. Is there a way in Singular to find q1, q2, …, qn for each polynomial jk in J such that the following holds (i.e., represent jk as a combination of polynomials in I)?

jk = q1*i1 + q2*i2 + … + qn*in
Post Posted: Thu Sep 01, 2016 10:16 am


It is currently Sat Dec 16, 2017 1:01 pm
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group