I believe Qhull is in the new Scipy?
- kcrisman
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-support
URL: h
Hi all:
I tried installing the Qhull package which is an optional package on
the list at http://www.sagemath.org/packages/optional/, but i got the
error below. It appears that /usr/include/float.h can't be found, but
i *do* have that file. Any suggestions for how to install Qhull
successfully?
This is really cool and seems to be exactly what I need. Thank you
very much!
Cheers,
Johan
On Apr 5, 3:19 pm, luisfe wrote:
> On Apr 5, 2:10 pm, "Johan S. R. Nielsen" wrote:
>
> > Oops, continuing:
>
> > more precisely, we wish to find a q in Q[Y1, Y2] such that q(f1, f2) =
> > g. In this case
On Apr 5, 2:10 pm, "Johan S. R. Nielsen" wrote:
> Oops, continuing:
>
> more precisely, we wish to find a q in Q[Y1, Y2] such that q(f1, f2) =
> g. In this case, we have
> q(Y1, Y2) = Y1^2 + Y1*Y2 - Y2
> as a solution, as
> f1^2 + f1*f2 - f2 = g
This is an elimination problem. Note that it is n
Oops, continuing:
more precisely, we wish to find a q in Q[Y1, Y2] such that q(f1, f2) =
g. In this case, we have
q(Y1, Y2) = Y1^2 + Y1*Y2 - Y2
as a solution, as
f1^2 + f1*f2 - f2 = g
As far as I can see, I can't easily use the lift function for this, as
the ideal's polynomials will always be lin
Thanks for the swift reply! That is a neat function, but I don't think
it is what I need. I was being too unclear, so here is an example:
Let R = Q[x], f1 = x^2 + 1 and f2 = x + 3 and g = x4+x3+4x2+x+3. We
wish to write g as a polynomial in f1 and f2 over Q; more precisely,
we wish to find a q
On Tue, Apr 5, 2011 at 1:24 PM, Johan S. R. Nielsen
wrote:
> Let's say that I have a multivariate polynomial ring R which contains
> the polynomials p, f1, ..., fn. I also know that p is in the ideal J =
> . Now I wish to write p as a polynomial in the f-
> polynomials. How can I do that with Sage
Hi
Let's say that I have a multivariate polynomial ring R which contains
the polynomials p, f1, ..., fn. I also know that p is in the ideal J =
. Now I wish to write p as a polynomial in the f-
polynomials. How can I do that with Sage?
I can get some of the way by constructing J and ask for a Grö
Hello,
I get an error message when trying to compare some algebraic numbers.
Here is the simplest example I could get:
{{{
#!python
sage: M = matrix(3, [0,0,1,1,0,1,0,1,0])
sage: x = vector([0,0,1])
sage: y = M.eigenvectors_left()[1][1][0]
sage: z = M.eigenvectors_left()[2][1][0]
sage: a = abs(x
