Couldn't we define something like :
def _len_(self):
return ...
that behave like we want as it is done for _str_ and _repr_ ?
Sébastien Labbé
LaCIM, Montréal
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscrib
On Feb 25, 3:05 am, water wrote:
> if I need to wait sage 3.4 ?
Hi,
Sage 3.4 won't fix the issue since it needs to be out by friday at the
latest and I will need to work on other things until then.
I have thought about this some more and it seems strange that the
compiler would complain abou
On Wed, Feb 25, 2009 at 7:52 PM, mabshoff wrote:
>
>
>
> On Feb 24, 7:17 pm, "M. Yurko" wrote:
>> OK, upon further inspection, I realized that something must have gone
>> wrong during the upgrade, so I''l just recompile from scratch again.
>> The terminal when I launch sage says 3.3 and version(
On Feb 24, 7:17 pm, "M. Yurko" wrote:
> OK, upon further inspection, I realized that something must have gone
> wrong during the upgrade, so I''l just recompile from scratch again.
> The terminal when I launch sage says 3.3 and version() gives 3.3, but
> the number below the sage logo in the no
On Wed, Feb 25, 2009 at 4:34 PM, Rob Beezer wrote:
>
> Francisco,
>
> When I work with undergraduate students, I stick to permutation groups
> in Sage since they are more concrete. When you compute a quotient
> group what you get back is a permutation group that is isomorphic to
> the quotient,
The transposes have been sped-up nicely by Yann Laigle-Chapuy
http://trac.sagemath.org/sage_trac/ticket/5345
http://trac.sagemath.org/sage_trac/ticket/5369
I've added the refactoring into Trac as #5381
http://trac.sagemath.org/sage_trac/ticket/5381
Rob
--~--~-~--~~~-
On Feb 24, 9:25 pm, "Georg S. Weber"
wrote:
> Hi Michael,
Hi Georg,
> this got me a bit high-spirited
:)
>, so I assembled another singular.spkg
> with some bigger cleanups w.r.t memory allocator usage. I did a
> complete build with this spkg dropped into Sage 3.3 instead of the
> original
Dear Michael,
On Feb 26, 2:31 am, mabshoff wrote:
>
>
> Well, glibc 2.3.4 is not compiled with the same config options
> everywhere, so in the end if you do not find a matching binary
> compiling from sources is highly recommended. You tried that as you
> mentioned about, so if it isn't an Open
On Thu, Feb 26, 2009 at 2:06 AM, William Stein wrote:
>
>> I grant the user the right to use PyFSA under GPLv2 or any later version of
>> GPL.
>>
>> -- Oliver
>
> Awesome! Many thanks!! That will make it much easier.
Excellent! I'll play with PyFSA and attempt to integrate it with Sage.
--
On Wed, Feb 25, 2009 at 6:00 PM, Oliver Steele wrote:
> On Feb 25, 2009, at 6:30 PM, William Stein wrote:
>>
>> Just a heads up. We currently have a policy not to include standard
>> any code that is
>> (L)GPLv3 licensed in Sage. We can include GPLv2+ code, i.e., "the
>> author grants the
>> u
On Feb 25, 11:55 am, Jaap Spies wrote:
> John Cremona wrote:
> > I get the same two failures as John Palmieri. This is on Suse linux.
>
> > John
>
> I join the party with the same two failures on Fedora 9 and 10, 32 bits.
>
> Jaap
Ok, I am in Athens, UGA and ready to work a while before catch
On Feb 25, 11:34 am, Burcin Erocal wrote:
> Hi,
>
> On Wed, 25 Feb 2009 10:53:48 -0800
>
> William Stein wrote:
>
> > I received this question from a potential Sage developer. Any
> > thoughts?
>
> > "Hi William. I notice that the package Polybori is included with SAGE
> > now. I know that
On Feb 25, 12:30 pm, Amir wrote:
> Got the following error:
Hi Amir,
> export MAKE="make -j1",
>
> with the same error. Machine is a node of a heterogeneous cluster of
> 'Rocks' linux opteron and xeon machines.
Ok, any chance you do not have any OpenSSL installed by the system?
Python reli
On Wed, Feb 25, 2009 at 3:05 PM, Minh Nguyen wrote:
>
> Dear Oliver,
>
> On Wed, Feb 25, 2009 at 6:51 PM, Oliver Steele wrote:
>> Hello.
>>
>> It was licensed under some ancient version of the OSI Artistic License,
>> mostly for historical reasons.
>>
>> I hereby license it to you under the term
On Wed, Feb 25, 2009 at 2:33 PM, Maurizio wrote:
>
> Carl,
> this is certainly reasonable, but maybe a little unfeasible.
...
> Can you derive some information from this description, or has this
> been useless? Maybe I can provide something like the last part of the
> notebook, placing some inter
On Wed, Feb 25, 2009 at 2:43 PM, Florent Hivert
wrote:
>
> Dear All,
>
> We working in combinat have a problem of naming convention which is likely to
> concern everyone in sage. As you can guess, in combinatorics we like to count
> sets an iterate through them. So we designed some objects c
+1 for s.card() but I would suggest also making s.cardinality() an
alias for it.
didier
On Wed, Feb 25, 2009 at 5:43 PM, Florent Hivert
wrote:
>
> Dear All,
>
> We working in combinat have a problem of naming convention which is likely to
> concern everyone in sage. As you can guess, in co
Dear Oliver,
On Wed, Feb 25, 2009 at 6:51 PM, Oliver Steele wrote:
> Hello.
>
> It was licensed under some ancient version of the OSI Artistic License,
> mostly for historical reasons.
>
> I hereby license it to you under the terms of the LGPLv3 license:
> http://www.opensource.org/licenses/lgpl
You are right, of course. I am modifying the trac ticket to correct this.
Best,
Alex
On Wed, Feb 25, 2009 at 10:06 PM, Ralf Hemmecke wrote:
>
> > Yes, this is a bug. The result should be O(z^0), just as in the
> > following example:
> >
> > sage: S. = QQ[[]]
> > sage: p = 1 + z + O(z^2)
> > s
Dear All,
We working in combinat have a problem of naming convention which is likely to
concern everyone in sage. As you can guess, in combinatorics we like to count
sets an iterate through them. So we designed some objects called for now
CombinatorialClass which represent a finite or count
Carl,
this is certainly reasonable, but maybe a little unfeasible.
The reason is that, I use some scripts of mine in the process of the
evaluation, and the whole process is pretty long.
The algorithm basically starts from a couple of linear systems of
equations; they are solved, and from the sol
This is slightly off-topic, but: Carl Witty and Jason Grout have a patch on
trac #5249 for implicit 3-D plotting (using Jmol or tachyon). It works very
well on the examples that I have tried; it does have some issues (as
described in the trac ticket), but it should be possible to fix them.
Best,
forgot actual link to surf: http://surf.sourceforge.net/
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group
Surf, part of Surfer: http://www.imaginary2008.de/surfer.php - license gplv2+
the source builds+runs on my ubuntu 8.10. therefore it could be used
to visualize 3d equations implicitly (contours maybe too?)
examples: http://www.imaginary2008.de/galerie.php
but it is buggy, it doesn't recognize my e
Francisco,
When I work with undergraduate students, I stick to permutation groups
in Sage since they are more concrete. When you compute a quotient
group what you get back is a permutation group that is isomorphic to
the quotient, e.g.
G=SymmetricGroup(5)
H=AlternatingGroup(5)
G.quotient_group
A couple of ideas:
(1) I think group rings are only partially implemented. In other words,
if R is a commutative ring, such as ZZ or a finite field say, and
G is a finite group, implement more methods for R[G]. There aren't
many methods implemented for it yet (these would be useful for coding
the
On Wed, Feb 25, 2009 at 12:38 PM, Francisco Veach wrote:
>
> I'm planning a semester-long project for the fall that will involve
> implementing/improving algebra related functions of Sage. I'm taking
> this time now and in the summer to familiarize myself with the
> internals so that I can have a
I'm planning a semester-long project for the fall that will involve
implementing/improving algebra related functions of Sage. I'm taking
this time now and in the summer to familiarize myself with the
internals so that I can have at least 4 months of actual programming
time.
I'd like to hear any a
Got the following error:
make[2]: Leaving directory `/titan_home/uhm/khosra/sage-3.3/spkg/build/
python-2.5.2.p8/src'
Sleeping for three seconds before testing python
Traceback (most recent call last):
File "", line 1, in
File "/usit/titan/u1/khosra/sage-3.3/local/lib/python2.5/md5.py",
line
I know you're in a rush, and I am not familiar with the evaluation
process, but you might want to tone down the language a bit.
Understatement can be stronger than overstatement. And numbers speak
for themselves.
For example, on page 3 we read that Pynac is "extremely fast". Well,
"extremely"
On Wed, Feb 25, 2009 at 11:05 AM, Maurizio wrote:
> So I manually write down the same expression in a new variable, I get:
>
> time dizTemp = temp.subs(paramsd)
> Time: CPU 0.01 s, Wall: 0.01 s
>
> And temp and G_igr_d have the same type!!
>
> Where can the lag arise from? This seems really subtl
John Cremona wrote:
> I get the same two failures as John Palmieri. This is on Suse linux.
>
> John
>
I join the party with the same two failures on Fedora 9 and 10, 32 bits.
Jaap
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegro
Hi,
On Wed, 25 Feb 2009 10:53:48 -0800
William Stein wrote:
>
> I received this question from a potential Sage developer. Any
> thoughts?
>
> "Hi William. I notice that the package Polybori is included with SAGE
> now. I know that Polybori (at least for the moment) uses the package
> CUDD
Thank you very much Yann!!
Today I upgraded to SAGE 3.3, to check if there was an improvement,
but I had the very same results than before.
Now I see this strange behaviour:
time dizSub = G_igr_d.subs(paramsd)
Time: CPU 10.64 s, Wall: 21.53 s
But if I do:
var('s')
temp = (2*Iin*rCb/Lf + 2*Vb/L
I received this question from a potential Sage developer. Any thoughts?
"Hi William. I notice that the package Polybori is included with SAGE
now. I know that Polybori (at least for the moment) uses the package
CUDD (for binary decision diagrams), and includes it in the package.
Do you know if
On Wed, Feb 25, 2009 at 10:25 AM, Timothy Clemans
wrote:
>
> RRF web page states
> "The University of Washington owns any patents, trademarks, copyrights
> or other work with commercial value from discoveries and inventions
> resulting from work funded by the Royalty Research Fund and these will
RRF web page states
"The University of Washington owns any patents, trademarks, copyrights
or other work with commercial value from discoveries and inventions
resulting from work funded by the Royalty Research Fund and these will
be administered in accordance with the University's Patent, Inventio
I get the same two failures as John Palmieri. This is on Suse linux.
John
On 25 Feb, 16:21, "Justin C. Walker" wrote:
> On Feb 24, 2009, at 15:59 , mabshoff wrote:
>
>
>
> > Hello folks,
>
> > this is Sage 3.4.alpha0, more or less on time. We merged a massive
> > number of ReST patches (Mike H
On Feb 24, 2009, at 15:59 , mabshoff wrote:
>
> Hello folks,
>
> this is Sage 3.4.alpha0, more or less on time. We merged a massive
> number of ReST patches (Mike Hansen) and additionally fixed a number
> of long standing libSingular issues (Georg Weber, Carl Witty, William
> Stein, Michael Absh
Probably obvious that I would be in favor of this getting funded :)
I'm cc:ing this to sage-edu as well, along with the original post.
Link to proposal is
http://groups.google.com/group/sage-devel/attach/1f195a7c190bab0e/research.pdf?part=2
As for comments, probably too late but here goes: After
John Cremona writes:
> I agree: composition of power series should only be allowed when the
> "inner" one has positive valuation, i.e. zero constant term. (At
> least over an integral domain. Maybe it's ok if the constant term is
> just a zerodivisor, but I cannot think of a situation where th
I don't think Jan has a trac account. I have created #5371 to address
this problem. Because of the cleaning up of the autosaves in 3.3, I
don't think such a long autosave interval is desirable, so I am
suggesting an interval of 5 minutes and a max history of 50 be the
defaults. I should be able
Hi Michael!
On Feb 25, 12:17 pm, Michael Brickenstein wrote:
> In my slimgb test files, usually I do the following:
> - normalize the leading coefficient to 1
> - consider only the leading terms
> - sort the list
> If the algorithm gives back not necessarily a reduced GB, but a
> minimal GB, we
I agree: composition of power series should only be allowed when the
"inner" one has positive valuation, i.e. zero constant term. (At
least over an integral domain. Maybe it's ok if the constant term is
just a zerodivisor, but I cannot think of a situation where that would
be needed!)
It would
Hi!
It's true, that redSB might have some influence on the code run inside
Singular.
In my slimgb test files, usually I do the following:
- normalize the leading coefficient to 1
- consider only the leading terms
- sort the list
If the algorithm gives back not necessarily a reduced GB, but a
minim
> Yes, this is a bug. The result should be O(z^0), just as in the
> following example:
>
> sage: S. = QQ[[]]
> sage: p = 1 + z + O(z^2)
> sage: q = 1 + z
> sage: p(q)
> O(z^0)
>
> This is now trac #5367.
Are you sure that O(z^0) is correct?
x = 1 + z + z^2 + z^3 + ... (ad infinitum)
would be
if I need to wait sage 3.4 ?
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/
if I need to wait sage 3.4 ?
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/
>>> Warning: something went wrong updating the easy-install.pth file.
>>> sage:
>>> What exactly does that warning mean. Is now something broken?
>> This ishttp://trac.sagemath.org/sage_trac/ticket/5351caused probably
>> by the update to setuptools. I'm think that things should be fine.
>> This s
OK setting aside the slightly off-topic of Gentoo ricers.
I worked out where the actual log is for building clisp from
the spkg and reproduced the various steps in the sage
environment (no playing with C(XX)FLAGS) - I use gcc-4.3.3.
First we have an interesting warning at the beginning
that may
Jason Grout wrote:
> Carl Witty wrote:
>> On Tue, Feb 24, 2009 at 10:42 PM, John H Palmieri
>> wrote:
>>> One question: how do I build the documentation?
>> With "sage -docbuild". Type just "sage -docbuild" to list all the
>> possibilities; the simplest is just "sage -docbuild reference html",
>
Carl Witty wrote:
> On Tue, Feb 24, 2009 at 10:42 PM, John H Palmieri
> wrote:
>> One question: how do I build the documentation?
>
> With "sage -docbuild". Type just "sage -docbuild" to list all the
> possibilities; the simplest is just "sage -docbuild reference html",
> which will grind away
found another little bug. The function sage-view-disable-inline-plots
works fine when called interactively (after run-sage, that is) -- but
in my case it does not work when placed in sage-startup-hook as
suggested on the wiki page ! i mean i have
(add-hook 'sage-startup-hook 'sage-view-always 'sa
Hi William,
I don't know if it is already too late...
Typos have already been mentioned by others.
My remark concerns the second paragraph on page 2 and is about
psychology of perception: Your formulations in this paragraph seem
rather negative to me. Of course, a careful reader will intellectu
54 matches
Mail list logo
