I think that rpm cannot be used to install into home directory, since
the install patch is hardwired in the rpm. Ask at the forum specific
to your distribution.
You can also try to install from sources or texlive. I think that both
can be installed to home directory without root priviledges. But
-- Forwarded message --
From: Christian Szegedy christian.szeg...@gmail.com
Date: Thu, Dec 17, 2009 at 12:26 AM
Subject: sage bug report
To: William Stein wst...@gmail.com
Simple 8X8 matrix determinant computation makes sage hang:
load x.py
test()
On the other hand if m.det()
Dear support, maybe I missed something, but I am not able to find
command for dividing polynomials (to get the quotient and the
remainder). Can you help me? Many thanks.
Robert
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Hi Robert!
sage: R.t = QQ[]
sage: p = R.random_element()
sage: q = R.random_element()
sage: p
-t^2 - 1/2*t + 1/2
sage: q
-t - 4/3
sage: p.quo_rem(q)
(t - 5/6, -11/18)
Best regards,
Simon
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send
Hi,
there was a typing mistake in above differences:
y=function('y',x)
y1=diff(y,x,1)
y2=diff(y1,x,2)
y3=diff(y2,x,3)
...
y253=diff(y252,x,253)
z=function('z',x)
z1=diff(z,x,1)
z2=diff(z1,x,2)
z3=diff(z2,x,3)
...
z253=diff(z252,x,253)
etc.
this should be:
y=function('y',x)
Many thanks. Robert.
On 17 pro, 11:03, Simon King simon.k...@nuigalway.ie wrote:
Hi Robert!
sage: R.t = QQ[]
sage: p = R.random_element()
sage: q = R.random_element()
sage: p
-t^2 - 1/2*t + 1/2
sage: q
-t - 4/3
sage: p.quo_rem(q)
(t - 5/6, -11/18)
Best regards,
Simon
--
To post to
perhaps problems expanding polynomials? even determinant of submatrix
(0,0,5,5) is suprisingly slow.
workaroud is to replace polynomials in your matrix by variables.
var('x0 x1 x2 x3 x4 x5 x6 x7 a1 a2 a3 a4 a5 a6 a7 b1 b2 b3 b4 b5 b6
b7')
m=matrix([[ 0, a1, a2, a3, a4, a5, a6, a7],
[b1,
Hi,
I got the result from Maxima as shown without any further lines or
assignments to Sage variables.
You probably need to write with small letters
maxima.de_solve_laplace
instead of
maxima.de_solve_Laplace
(sorry about my email system automatically correcting for the first
letter in word
And another observation:
maxima returns answer immediatelly (with a lag necessary to start
maxima)
m is the original matrix from x.py
sage: m._maxima_().determinant().expand().sage()
x0^2*x2^2*x3^2*x7^2 - 2*x0*x1*x2*x3*x4*x5*x6*x7 + x1^2*x4^2*x5^2*x6^2
Anyway, the answer is different from
Hi
When in a Sage notebook how do I find what the current working
directory is and how do I do a directory listing? For example in
MATLAB I might do
pwd
to print the working directory and
ls
to do a directory listing.
Please accept my apologies if this information is available somewhere
On Dec 17, 2009, at 4:48 AM, Walking Randomly wrote:
Hi
When in a Sage notebook how do I find what the current working
directory is and how do I do a directory listing? For example in
MATLAB I might do
pwd
to print the working directory and
ls
to do a directory listing.
Please
Hi both
Thanks for your replies. It seems to me then that filehandling in the
Sage notebook is not as intuitive as it could be then.
Now that you guys have told me about it, I see that the Sage command
line works exactly as I would expect and I feel instantly at home with
it.
The notebook
Hello again
So I wondered if I could work through the matplotlib image processing
tutorial using the SAGE notebook
http://matplotlib.sourceforge.net/users/image_tutorial.html
and evaluated this code
import matplotlib.pyplot as plt
import matplotlib.image as mpimg
import numpy as np
On Thu, Dec 17, 2009 at 9:48 PM, Walking Randomly
michael.p.crouc...@googlemail.com wrote:
Hi both
Thanks for your replies. It seems to me then that filehandling in the
Sage notebook is not as intuitive as it could be then.
Now that you guys have told me about it, I see that the Sage
On 17 dic, 11:48, ma...@mendelu.cz ma...@mendelu.cz wrote:
And another observation:
maxima returns answer immediatelly (with a lag necessary to start
maxima)
m is the original matrix from x.py
sage: m._maxima_().determinant().expand().sage()
x0^2*x2^2*x3^2*x7^2 -
Hi Mike,
Just use
plt.savefig('test.png')
instead of plt.imshow(img)
Then you get the image.
Greets!
Stefan
On Thursday 17 December 2009 03:01:25 pm Walking Randomly wrote:
Hello again
So I wondered if I could work through the matplotlib image processing
tutorial using the SAGE
And also:
sage: p//q
t - 5/6
sage: p%q
-11/18
--
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:
Thanks! Is there faster way how to tell Sage that we want to divide
polynomials than these commands? I mean, if the third line can be
omitted.
p=x^2+x+5
q=x-4
R.x=QQ[]
R(p).quo_rem(q)
Robert.
On 17 pro, 18:18, Pablo Angulo pablo.ang...@uam.es wrote:
And also:
sage: p//q
t - 5/6
sage: p%q
Robert, great stuff. I am installing now. How long does it take?
On Dec 17, 1:33 am, ma...@mendelu.cz ma...@mendelu.cz wrote:
I think that rpm cannot be used to install into home directory, since
the install patch is hardwired in the rpm. Ask at the forum specific
to your distribution.
You
Thanks for the helping, it was very useful, and yes that answers my
questions, but well I have another question. There is a command in
sage that is similar or equal to the fscanf function that exists for
example in matlab ?
Thanks for the attention again.
--Genaro
--
To post to this group,
I'm in the middle of implementing SAGE classes for binary decision
diagrams using the library called CUDD (which is included in
Polybori). Each BDD is actually a labeled DiGraph. It's standard in
the BDD literature to draw pictures of the digraph as follows:
the vertex label of a non-leaf is a
You evaluate it over ZZ[x1,...,xn] rather than GF(2)[x1,...,x4].
Anyways, it simply can't be *that* slow in any case: even: the
(theoretically ) maximum number of monoms that can be in any
expansion is less than a few thousands, so the upper limit
for a naively implemented Gaussian elimination is
Not an answer, but a side question (probably belongs to sage-devel, anyhow...)
Why would you use BDDs in the first place?
For almost any applications, SAT-solvers beat BDDs by large margins,
and also have incremental implementations. One of the best (also
insustrially used)
SAT solvers: MiniSAT
On Thu, Dec 17, 2009 at 2:55 PM, Christian Szegedy
christian.szeg...@gmail.com wrote:
Not an answer, but a side question (probably belongs to sage-devel, anyhow...)
Why would you use BDDs in the first place?
For almost any applications, SAT-solvers beat BDDs by large margins,
and also have
It took about hour and a half. The fonts are a little fuzzy. Is
there anyway to fix this?
On Dec 17, 11:38 am, Mikie thephantom6...@hotmail.com wrote:
Robert, great stuff. I am installing now. How long does it take?
On Dec 17, 1:33 am, ma...@mendelu.cz ma...@mendelu.cz wrote:
I think
On Thu, Dec 17, 2009 at 11:55 AM, Christian Szegedy
christian.szeg...@gmail.com wrote:
Not an answer, but a side question (probably belongs to sage-devel, anyhow...)
Why would you use BDDs in the first place?
For almost any applications, SAT-solvers beat BDDs by large margins,
and also have
On Thu, Dec 17, 2009 at 10:29 AM, ma...@mendelu.cz ma...@mendelu.cz wrote:
Thanks! Is there faster way how to tell Sage that we want to divide
polynomials than these commands? I mean, if the third line can be
omitted.
p=x^2+x+5
q=x-4
R.x=QQ[]
R(p).quo_rem(q)
No. But you have the order
The speed could be do to the inefficiency of fraction field arithmetic
over the polynomial ring. Ideally, we should have fraction-free
gaussian elimination. Also, easily invertable/small determinant may
actually be worse--as it could be creating a lot of large intermediate
values with
It is impossible to come up with any reasonable explanation for this
kind of slowdown. Even if you do extremely stupid things like
summing all permutations and simplifying the expression at the end, you
can't get that slow.
Additionally, you cansee that the inverse is computed readily. If you
On Thu, Dec 17, 2009 at 5:58 PM, Christian Szegedy
christian.szeg...@gmail.com wrote:
It is impossible to come up with any reasonable explanation for this
kind of slowdown. Even if you do extremely stupid things like
summing all permutations and simplifying the expression at the end, you
can't
On Dec 17, 2009, at 5:58 PM, Christian Szegedy wrote:
It is impossible to come up with any reasonable explanation for this
kind of slowdown. Even if you do extremely stupid things like
summing all permutations and simplifying the expression at the end,
you
can't get that slow.
No, but if
On Thu, Dec 17, 2009 at 7:16 PM, Sebastian Pancratz
sebastian.pancr...@hertford.ox.ac.uk wrote:
Dear William,
This is just a very brief reply (before going to bed, it's past 3am here).
I've added the bug report as ticket #7730.
http://trac.sagemath.org/sage_trac/ticket/7730
After I've had
On Dec 14, 10:01 pm, Timothy Paysen timothy.pay...@gmail.com wrote:
The VirtuaBox incarnation doesn't seem to be able to get to a Sage notebook.
It will bring you to the Sage web sit--but nothing more. So--can't even
say whether it works well or not--it just doesn't seem to work.
If you are
33 matches
Mail list logo
