On Jun 4, 2009, at 13:18 , William Stein wrote:
> On Thu, Jun 4, 2009 at 1:04 PM, Kiran Kedlaya
> wrote:
[snip]
>
> There's now an rc1 with that #6209 thing fixed:
>
> http://sage.math.washington.edu/home/mhansen/release/4.0.1/rc1/sage-4.0.1.rc1/
>
> and
>
> http://sage.math.washington.edu/ho
Hi Jason,
I looked at your work at #3048. Are you aware of the "formulas" that
can be used to compute individual entries of L and U, in something of
a recursive fashion (lower right entries of each matrix depend on
already computed upper left entries of both L and U)? Looks like it
would only r
On Jun 4, 2009, at 13:18 , William Stein wrote:
>
> On Thu, Jun 4, 2009 at 1:04 PM, Kiran Kedlaya
> wrote:
[snip]
> There's now an rc1 with that #6209 thing fixed:
>
> http://sage.math.washington.edu/home/mhansen/release/4.0.1/rc1/sage-4.0.1.rc1/
>
> and
>
> http://sage.math.washington.edu/ho
On Jun 4, 2009, at 9:42 PM, Craig Citro wrote:
>
>>> How do you generally use the matrix after you call change_ring
>>> ()? It
>>> seems like the normal thing to do would be to change the matrix in
>>> some
>>> way. In that case, it is a huge bonus to have consistency between
>>> returning the
>> How do you generally use the matrix after you call change_ring()? It
>> seems like the normal thing to do would be to change the matrix in
>> some
>> way. In that case, it is a huge bonus to have consistency between
>> returning the original object and returning a copy.
>
> I usually use chan
On Jun 4, 2009, at 8:53 PM, Jason Grout wrote:
> Robert Bradshaw wrote:
>> On Jun 4, 2009, at 5:48 PM, Craig Citro wrote:
>>
> Should this be changed so that m.change_ring(R) always returns a
> copy?
Yes, I think so.
>>> +1
>>
>> I'd say No. I think change_ring should be fast wh
Robert Bradshaw wrote:
> On Jun 4, 2009, at 5:48 PM, Craig Citro wrote:
>
Should this be changed so that m.change_ring(R) always returns a
copy?
>>> Yes, I think so.
>>>
>> +1
>
> I'd say No. I think change_ring should be fast when it's already the
> right ring, it shouldn't be use
On Jun 4, 2009, at 5:48 PM, Craig Citro wrote:
>
>>> Should this be changed so that m.change_ring(R) always returns a
>>> copy?
>>
>> Yes, I think so.
>>
>
> +1
I'd say No. I think change_ring should be fast when it's already the
right ring, it shouldn't be used for making copies (unless
n
On Thu, Jun 4, 2009 at 8:58 PM, Mike Hansen wrote:
>
> On Thu, Jun 4, 2009 at 5:26 PM, David Joyner wrote:
>>
>> Is the flint build fixed in 4.0.1.rc1? On ox 10.4 I get:
>>
>
> Unfortunately there was a silly typo in the spkg-install file. See
> http://trac.sagemath.org/sage_trac/ticket/6219 fo
On Thu, Jun 4, 2009 at 5:26 PM, David Joyner wrote:
>
> Is the flint build fixed in 4.0.1.rc1? On ox 10.4 I get:
>
Unfortunately there was a silly typo in the spkg-install file. See
http://trac.sagemath.org/sage_trac/ticket/6219 for a new spkg.
--Mike
--~--~-~--~~~
>> Should this be changed so that m.change_ring(R) always returns a copy?
>
> Yes, I think so.
>
+1
-cc
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@go
>> Should this be changed so that m.change_ring(R) always returns a
>> copy?
>
> Yes, I think so.
+1
Nick
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr..
On Thu, Jun 4, 2009 at 4:36 PM, Jason Grout wrote:
>
> It seems confusing and inconsisent that for a matrix m, m.change_ring(R)
> returns m when R==self.base_ring(), but otherwise returns a copy of m
> (coerced to the right ring).
>
> If you always just do new_mat = m.change_ring(R), you don't kn
Is the flint build fixed in 4.0.1.rc1? On ox 10.4 I get:
...
gcc -std=c99 -I/Users/davidjoyner/sagefiles/sage-4.0.1.rc0/local/include/
-I/Users/davidjoyner/sagefiles/sage-4.0.1.rc0/local/include -fPIC
-funroll-loops -O3 -c fmpz.c -o fmpz.o
fmpz.c:40:29: error: zn_poly/zn_poly.h: No such file o
William Stein wrote:
> 2009/6/4 Mike Hansen :
>> Hello,
>>
>> Now that sage.math is back up, I've cut rc0 and put it in
>> /home/mhansen/sage-4.0.1.rc0.tar. All tests passed on sage.math.
>>
Ok, note that this is rc1 on Fedora 10, 32 bit:
The followin tests failed:
sage -t "devel/sage/sage/s
It seems confusing and inconsisent that for a matrix m, m.change_ring(R)
returns m when R==self.base_ring(), but otherwise returns a copy of m
(coerced to the right ring).
If you always just do new_mat = m.change_ring(R), you don't know if
you're working with a copy of m or a new version of m,
On Thu, Jun 4, 2009 at 2:46 PM, Nick Alexander wrote:
>
>
> On 4-Jun-09, at 2:46 PM, Jason Grout wrote:
>
>>
>> If I were to attempt to add LU decomposition to general matrices in
>> Sage, where would I start? I could write a naive algorithm, but I
>> also
>> found an implementation in linbox.
On 4-Jun-09, at 2:46 PM, Jason Grout wrote:
>
> If I were to attempt to add LU decomposition to general matrices in
> Sage, where would I start? I could write a naive algorithm, but I
> also
> found an implementation in linbox. I suppose there might be an
> implementation in other libraries
If I were to attempt to add LU decomposition to general matrices in
Sage, where would I start? I could write a naive algorithm, but I also
found an implementation in linbox. I suppose there might be an
implementation in other libraries we include.
1. Is wrapping linbox likely the best option
On Thu, Jun 4, 2009 at 1:44 PM, Harald Schilly wrote:
>
> i got this bug report from the "report a problem" link in the
> notebook, i can confirm this on sagenb.org using 4.0
>
> ---
>
> When running the following code, Sage 4.0 segfaults.
>
> theta1,theta2=var('theta1,theta2')
> g0=theta1
> h0=g
i got this bug report from the "report a problem" link in the
notebook, i can confirm this on sagenb.org using 4.0
---
When running the following code, Sage 4.0 segfaults.
theta1,theta2=var('theta1,theta2')
g0=theta1
h0=g0.subs(theta1=1,theta2=0)
Various perturbations (such as not subbing for
On Thu, Jun 4, 2009 at 1:40 PM, Harald Schilly wrote:
>
> I got this bug report from the "report a problem" link in the
> notebook:
>
> problem description:
>
> I did some basic control systems theory, but the output looks way too
> much complicated, previous version was much better in this aspec
I got this bug report from the "report a problem" link in the
notebook:
problem description:
I did some basic control systems theory, but the output looks way too
much complicated, previous version was much better in this aspect.
A = matrix([[1,-3,-1,-2],[2,-1,1,-1],[0,2,-3,1],[-3,4,-1,1]])
B =
On Thu, Jun 4, 2009 at 1:04 PM, Kiran Kedlaya wrote:
>
> I have the same problem. Has the fix to #6209 been put in yet? I ran
> into this problem when I was reviewing the FLINT spkg, but it seemed
> to have been fixed the last time I downloaded the spkg (otherwise I
> wouldn't have given a positi
I have the same problem. Has the fix to #6209 been put in yet? I ran
into this problem when I was reviewing the FLINT spkg, but it seemed
to have been fixed the last time I downloaded the spkg (otherwise I
wouldn't have given a positive review!).
Kiran
On Jun 4, 11:51 am, William Stein wrote:
>
Jaap Spies wrote:
> William Stein wrote:
>> On Thu, Jun 4, 2009 at 10:34 AM, William Stein wrote:
>
>> I've put an empty README.txt at the above URL, so upgrade should work.
>>
>
> Maybe the file should not be empty?
>
I can confirm. Now it is not empty it works!
Jaap
--~--~-~--~--
Fidel wrote:
> Hello,
>
> I'm running sage-4.0
>
> Prof. Rafael Villarroel told me about some weird things happening in
> sage. Here is a sample session
>
> sage: L = list ( graphs(5, lambda G: G.is_bipartite()) ); len(L)
> 13
> sage: X = list ( graphs(5, lambda G: G.is_connected()) ); len(X)
>
William Stein wrote:
> On Thu, Jun 4, 2009 at 10:34 AM, William Stein wrote:
>
> I've put an empty README.txt at the above URL, so upgrade should work.
>
Maybe the file should not be empty?
Jaap
--~--~-~--~~~---~--~~
To post to this group, send email to sage
William Stein wrote:
> On Thu, Jun 4, 2009 at 10:34 AM, William Stein wrote:
>> On Thu, Jun 4, 2009 at 10:33 AM, Jaap Spies wrote:
>>> William Stein wrote:
2009/6/4 Mike Hansen :
> Hello,
>
> Now that sage.math is back up, I've cut rc0 and put it in
> /home/mhansen/sage-4.0.
On Thu, Jun 4, 2009 at 10:34 AM, William Stein wrote:
> On Thu, Jun 4, 2009 at 10:33 AM, Jaap Spies wrote:
>>
>> William Stein wrote:
>>> 2009/6/4 Mike Hansen :
Hello,
Now that sage.math is back up, I've cut rc0 and put it in
/home/mhansen/sage-4.0.1.rc0.tar. All tests passe
On Thu, Jun 4, 2009 at 10:33 AM, Jaap Spies wrote:
>
> William Stein wrote:
>> 2009/6/4 Mike Hansen :
>>> Hello,
>>>
>>> Now that sage.math is back up, I've cut rc0 and put it in
>>> /home/mhansen/sage-4.0.1.rc0.tar. All tests passed on sage.math.
>>>
>>
>
> Upgrading failed:
>
> Failed to downl
William Stein wrote:
> 2009/6/4 Mike Hansen :
>> Hello,
>>
>> Now that sage.math is back up, I've cut rc0 and put it in
>> /home/mhansen/sage-4.0.1.rc0.tar. All tests passed on sage.math.
>>
>
Upgrading failed:
Failed to download
'http://sage.math.washington.edu/home/mhansen/release/4.0.1/rc0
Hello,
I'm running sage-4.0
Prof. Rafael Villarroel told me about some weird things happening in
sage. Here is a sample session
sage: L = list ( graphs(5, lambda G: G.is_bipartite()) ); len(L)
13
sage: X = list ( graphs(5, lambda G: G.is_connected()) ); len(X)
0
sage: T = list ( graphs(5, lambd
On Thu, Jun 4, 2009 at 10:27 AM, Jason Grout
wrote:
>
> William Stein wrote:
>> 2009/6/4 Dr. David Kirkby :
>>> FWIW,
>>>
>>> sage-4.0.1.alpha0 compiled without any hickups on my Blade 2000 running
>>> Solaris 10 update 6.
>>
>> Did you run the test suite? I also built from scratch
>> sage-4.0.
William Stein wrote:
> 2009/6/4 Dr. David Kirkby :
>> FWIW,
>>
>> sage-4.0.1.alpha0 compiled without any hickups on my Blade 2000 running
>> Solaris 10 update 6.
>
> Did you run the test suite? I also built from scratch
> sage-4.0.1.alpha0 on a Blade 2000 (I think), and 5 file didn't pass
> the
> In the meantime, can someone cut an alpha0 for Mac OS X 10.5?
> (Preferably just tar.gz, not dmg.) Also, is such a thing done via
> just sage -bdist?
For anyone interested, I built a dmg and it is available at
http://sage.math.washington.edu/home/ncalexan/sage-4.0.1.alpha0-i386-Darwin.dmg
Ho
> FWIW,
>
> sage-4.0.1.alpha0 compiled without any hickups on my Blade 2000 running
> Solaris 10 update 6.
William Stein wrote:
> 2009/6/4 Dr. David Kirkby :
>> FWIW,
>>
>> sage-4.0.1.alpha0 compiled without any hickups on my Blade 2000 running
>> Solaris 10 update 6.
>
> Did you run the test
2009/6/4 Mike Hansen :
> Hello,
>
> Now that sage.math is back up, I've cut rc0 and put it in
> /home/mhansen/sage-4.0.1.rc0.tar. All tests passed on sage.math.
>
Thanks. On OSX 32-bit it fails quickly when trying to buid FLINT:
gcc -std=c99 -I/Users/was/build/sage-4.0.1.rc0/local/include/
-I/
2009/6/4 Dr. David Kirkby :
>
> FWIW,
>
> sage-4.0.1.alpha0 compiled without any hickups on my Blade 2000 running
> Solaris 10 update 6.
Did you run the test suite? I also built from scratch
sage-4.0.1.alpha0 on a Blade 2000 (I think), and 5 file didn't pass
the suite for me. 3 were due to ti
On Thu, Jun 4, 2009 at 9:17 AM, javier wrote:
>
> From a naive point of view, I'd say that everything I am doing stays
> inside the group G, so intersection of subsets of G should be
> understood as taken inside of G. To make it more confusing, look at
> this other example, just by changing the a
Dr. David Kirkby wrote:
>
> Again, like any version of Sage I've tried (including the binary Micheal
> compiled), the GUI interface, with
>
> 'notebook()'
>
> will not work for me. I'm unable to find any server listening on port
> 8.
I was checking port 8000 - the 8 is a typo.
--~--
>From a naive point of view, I'd say that everything I am doing stays
inside the group G, so intersection of subsets of G should be
understood as taken inside of G. To make it more confusing, look at
this other example, just by changing the ambient group:
sage: G = AlternatingGroup(6);
sage: g =
On Thu, Jun 4, 2009 at 8:44 AM, javier wrote:
>
> Hi there,
>
> running some programs that deal with subsets of groups I realized the
> following behaviour
>
> sage: G = AlternatingGroup(4);
> sage: g = G((1,2,3));
> sage: cl = Set([x*g*x^(-1) for x in G])
> sage: A = Set(G.centralizer(g));
> sag
Hi there,
running some programs that deal with subsets of groups I realized the
following behaviour
sage: G = AlternatingGroup(4);
sage: g = G((1,2,3));
sage: cl = Set([x*g*x^(-1) for x in G])
sage: A = Set(G.centralizer(g));
sage: A, cl, A.intersection(cl)
({(1,2,3), (1,3,2), ()}, {(1,3,4), (1,
FWIW,
sage-4.0.1.alpha0 compiled without any hickups on my Blade 2000 running
Solaris 10 update 6.
Again, like any version of Sage I've tried (including the binary Micheal
compiled), the GUI interface, with
'notebook()'
will not work for me. I'm unable to find any server listening on port
8
On Wed, 03 Jun 2009 at 10:00PM -0700, Nick Alexander wrote:
> On IRC tonight three different people were looking for binaries -- one
> Mac, one linux, one T2 (?) user. I know William builds a lot of
> binaries automatically. Is it possible to make this more automatic,
> so the mythical rele
46 matches
Mail list logo
