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 - certificate of algebraic dependence
Author Message
Guest
  Post subject:   Reply with quote
Yes, there are 3 procedures in algebra.lib

algebra_containment
inSubring
algDependent

testing algebraic dependence by different algoruthms.
Post Posted: Thu Aug 14, 2008 12:20 am
tortoisesaid
  Post subject:  certificate of algebraic dependence  Reply with quote
Hello all:

Is there a Singular function (or any algorithm whatsoever) that, given a finite set of algebraically dependent multivariate polynomials f_1,...,f_k
(over the rationals, say), computes an irreducible annihilating
polynomial for that set, that is, a nonzero irreducible polynomial P
(with rational coefficients) such that P(f_1,...,f_k) = 0? I
searched the Singular documentation on this topic but didn't find anything.

Cheers,
Alex
Post Posted: Tue Jul 29, 2008 1:16 am


It is currently Fri May 13, 2022 11:03 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group