[sage-devel] Re: spkg refactoring and development model
On 6/18/07, Brian Granger [EMAIL PROTECTED] wrote: I am talking about the both the directory structure that is needed for the script/makefiles to function properly: spkg/ standard/ base/ As well as the actual scripts and makefiles (deps, install, newest-version, etc) that have to be in particular locations in that tree to work properly. For instance, deps as to be in standard, install in spkg newest-version in standard, and a bunch of stuff has to be in base. I agree with this: the scripts in spkg/, spkg/base/ and spkg/standard/ should be under version control. SPKG.txt SPKG-README.txt I vote for SPKG.txt too. didier --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: spkg refactoring and development model
On 6/18/07, Brian Granger [EMAIL PROTECTED] wrote: Then SAGE wouldn't know that the package had been updated. Those version numbers are used to determine whether it is necessary to install a package. I didn't know SAGE was actually using them. Is this when sage -update is run? My understanding is that the decision to upgrade something was based on the timestamps if the files compared with the stub in the installed directory. Am I mistaken. The sage-update script gives an idea of how sage is upgraded from a SAGE_SERVER: - download the new install script - download the new list file. The list file contains all spkgs with their version numbers. It is from it that sage knows which packages have been updated and why specifying version numbers for now is necessary. - download the new deps file - download the newest_version script. newest_version determines the latest version of an spkg you have installed locally. - check the contents of your list file against your `ls spkg/standard/`. Anything that is in list and not in the output of ls is downloaded. didier --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] SD4 photos
Hi: Some SD4 photos at posted at http://sage.math.washington.edu/home/wdj/sd4photos/images.html, or at least they will be in 5 minutes or so. - David --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: SD4 photos
David Joyner wrote: Hi: Some SD4 photos at posted at http://sage.math.washington.edu/home/wdj/sd4photos/images.html, or at least they will be in 5 minutes or so. - David Sorry, but You don't have permission to access /home/wdj/sd4photos/STA70416.JPG on this server. (and probably others) Cheers, Michael --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: SD4 photos
Sorry about that! Should be fixed in a few minutes. On 6/19/07, Michael Abshoff [EMAIL PROTECTED] wrote: David Joyner wrote: Hi: Some SD4 photos at posted at http://sage.math.washington.edu/home/wdj/sd4photos/images.html, or at least they will be in 5 minutes or so. - David Sorry, but You don't have permission to access /home/wdj/sd4photos/STA70416.JPG on this server. (and probably others) Cheers, Michael --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] printing MPolynomialRing
Hi there, I would like to gather some options on the way multivariate polynomial rings are printed in SAGE. I happen to construct quite big rings with block orderings, so the usual one-line representation gets messy quickly. So I would like to have method -- like long_repr or so -- to print a ring more structured. EXAMPLE: Lets consider a ring for the small scale AES variant SR(10,1,1,4): = Usual: = Polynomial Ring in k1000, k1001, k1002, k1003, x1000, x1001, x1002, x1003, w1000, w1001, w1002, w1003, s900, s901, s902, s903, k900, k901, k902, k903, x900, x901, x902, x903, w900, w901, w902, w903, s800, s801, s802, s803, k800, k801, k802, k803, x800, x801, x802, x803, w800, w801, w802, w803, s700, s701, s702, s703, k700, k701, k702, k703, x700, x701, x702, x703, w700, w701, w702, w703, s600, s601, s602, s603, k600, k601, k602, k603, x600, x601, x602, x603, w600, w601, w602, w603, s500, s501, s502, s503, k500, k501, k502, k503, x500, x501, x502, x503, w500, w501, w502, w503, s400, s401, s402, s403, k400, k401, k402, k403, x400, x401, x402, x403, w400, w401, w402, w403, s300, s301, s302, s303, k300, k301, k302, k303, x300, x301, x302, x303, w300, w301, w302, w303, s200, s201, s202, s203, k200, k201, k202, k203, x200, x201, x202, x203, w200, w201, w202, w203, s100, s101, s102, s103, k100, k101, k102, k103, x100, x101, x102, x103, w100, w101, w102, w103, s000, s001, s002, s003, k000, k001, k002, k003 over Finite Field in a of size 2^4 = SINGULAR: = // characteristic : 2 // 1 parameter: a // minpoly: (a^4+a+1) // number of vars : 164 //block 1 : ordering dp // : namesk1000 k1001 k1002 k1003 //block 2 : ordering dp // : namesx1000 x1001 x1002 x1003 w1000 w1001 w1002 w1003 s900 s901 s902 s903 k900 k901 k902 k903 //block 3 : ordering dp // : namesx900 x901 x902 x903 w900 w901 w902 w903 s800 s801 s802 s803 k800 k801 k802 k803 //block 4 : ordering dp // : namesx800 x801 x802 x803 w800 w801 w802 w803 s700 s701 s702 s703 k700 k701 k702 k703 //block 5 : ordering dp // : namesx700 x701 x702 x703 w700 w701 w702 w703 s600 s601 s602 s603 k600 k601 k602 k603 //block 6 : ordering dp // : namesx600 x601 x602 x603 w600 w601 w602 w603 s500 s501 s502 s503 k500 k501 k502 k503 //block 7 : ordering dp // : namesx500 x501 x502 x503 w500 w501 w502 w503 s400 s401 s402 s403 k400 k401 k402 k403 //block 8 : ordering dp // : namesx400 x401 x402 x403 w400 w401 w402 w403 s300 s301 s302 s303 k300 k301 k302 k303 //block 9 : ordering dp // : namesx300 x301 x302 x303 w300 w301 w302 w303 s200 s201 s202 s203 k200 k201 k202 k203 //block 10 : ordering dp // : namesx200 x201 x202 x203 w200 w201 w202 w203 s100 s101 s102 s103 k100 k101 k102 k103 //block 11 : ordering dp // : namesx100 x101 x102 x103 w100 w101 w102 w103 s000 s001 s002 s003 k000 k001 k002 k003 //block 12 : ordering C === My Shameless Copy === Polynomial Ring Base Ring : Finite Field in a of size 2^4 Size : 164 Variables Block 0 : Ordering : degrevlex Names: k1000, k1001, k1002, k1003 Block 1 : Ordering : degrevlex Names: x1000, x1001, x1002, x1003, w1000, w1001, w1002, w1003, s900, s901, s902, s903, k900, k901, k902, k903 Block 2 : Ordering : degrevlex Names: x900, x901, x902, x903, w900, w901, w902, w903, s800, s801, s802, s803, k800, k801, k802, k803 Block 3 : Ordering : degrevlex Names: x800, x801, x802, x803, w800, w801, w802, w803, s700, s701, s702, s703, k700, k701, k702, k703 Block 4 : Ordering : degrevlex Names: x700, x701, x702, x703, w700, w701, w702, w703, s600, s601, s602, s603, k600, k601, k602, k603 Block 5 : Ordering : degrevlex Names: x600, x601, x602, x603, w600, w601, w602, w603, s500, s501, s502, s503, k500, k501, k502, k503 Block 6 : Ordering : degrevlex Names: x500, x501, x502, x503, w500, w501, w502, w503, s400, s401, s402, s403, k400, k401, k402, k403 Block 7 : Ordering : degrevlex Names: x400, x401, x402, x403, w400, w401, w402, w403, s300, s301, s302, s303, k300, k301, k302, k303 Block 8 : Ordering : degrevlex Names: x300, x301, x302, x303, w300, w301, w302, w303, s200, s201, s202, s203, k200, k201, k202, k203 Block 9 : Ordering : degrevlex Names: x200, x201, x202, x203, w200, w201, w202, w203, s100, s101, s102, s103, k100, k101, k102, k103 Block 10 : Ordering : degrevlex Names: x100, x101, x102, x103, w100, w101, w102, w103, s000, s001, s002, s003, k000, k001,
[sage-devel] Re: printing MPolynomialRing
I agree, the singular output is nice.I don't use such big rings, but I very often use two blocks: variables and parameters. On Jun 19, 7:26 am, Martin Albrecht [EMAIL PROTECTED] wrote: On Tuesday 19 June 2007 14:55, Martin Albrecht wrote: Hi there, I would like to gather some options on the way multivariate polynomial rings are printed in SAGE. Sorry for replying to myself, I meant to gather opinions not options of course. In case you wondered ... Martin -- name: Martin Albrecht _pgp:http://pgp.mit.edu:11371/pks/lookup?op=getsearch=0x8EF0DC99 _www:http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED] --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: spkg refactoring and development model
On 6/18/07, Brian Granger [EMAIL PROTECTED] wrote: I didn't know SAGE was actually using them. Is this when sage -update is run? My understanding is that the decision to upgrade something was based on the timestamps if the files compared with the stub in the installed directory. Am I mistaken. Yes. It is based on the version number. Timestamps aren't used for upgrading. OK, that makes sense. Is there a standard approach for these version numbers? At times I have seen a projects version number upgraded, but the .pn version number remain the same. For instance, the python spkg is named: python-2.5.1.p3.spkg But I don't think the .p3 means the third version of the spkg for python-2.5.1. The standard is package_name[dash]official-version[dash]sage_patch_number Thus python-2.5.1.p3.spkg is the fourth (0-based) version of the Python 2.5.1 package. If the package number jumped from 2.5.0.p3 to 2.5.1.p3 that would be a mistake. OK, that really clarifies things. I thought that might be the case, but the mistakes were throwing me off. As long as everyone understands this convention and updates the versions when they need to be this sounds fine. There is one case though that is not clear. If multiple people (even 2) have made changes to an spkg and both of them have updated the sage_patch_number, there is i) possibility for confusion as both packages will have the same version number, but contain different changes and ii) someone has to merge the changes and make sure the sage_patch_number is globally unique. Again, an informal social protocol will probably suffice in this case as well, but it is something that developers need to be aware of. This seems a bit confusing to me. Especially because some spkgs don't have a .pn version, even though they were updated. Sometimes a package is updated in a trivial way, e.g., something is added to the README or a directory is reorganized, but there is absolutely no reason to force very SAGE user out there to upgrade/build that package. In such cases, I usually do not update the version number. The thing that I keep running into though is that because of these minor changes (which are in fact important to keep) I can't trust the sage_patch_number to solely determine if a package has changed. I still have to do manual diff or look at md5sums to determine that. Granted, having hg repo for each spkg will completely solve this problem though. I don't mind having a version that denotes the spkg version, I just want to make sure that those version number are consistent and standardized and have a purpose that is not redundant. Could we use md5 sums for this? In many cases, I do this anyway, because the .pn version number is not a reliable way of determining if an spkg has changed. The md5 sums are unfortunately not in order, so that doesn't work. md5 only tells you whether two packages are different, not which is newer. Definitely. One issue is that it isn't a readme, actually. It's a description of how the package was made. True, then maybe SPKG.txt makes more sense? Or maybe BUILD-NOTES.txt? SPKG-BUILD-NOTES.txt? SPKG.txt is I think clearly the best choice given our constraints. Sounds good. Brian William --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: spkg refactoring and development model
Thanks, this does clarify what goes on in an update. The sage-update script gives an idea of how sage is upgraded from a SAGE_SERVER: - download the new install script - download the new list file. The list file contains all spkgs with their version numbers. It is from it that sage knows which packages have been updated and why specifying version numbers for now is necessary. - download the new deps file - download the newest_version script. newest_version determines the latest version of an spkg you have installed locally. Isn't newest_version already on the users system if they already have sage installed - it is usd to build sage in the first place. - check the contents of your list file against your `ls spkg/standard/`. Anything that is in list and not in the output of ls is downloaded. Brian didier --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: make test failure (possible solution)
William, A while ago I reported that the implementation of RR(0).exact_rational() made some machines run out of memory, giving weird doctest errors. You posted a patch (special casing zero) but I now see in the source of sage-2.6 you forgot to apply it. Can you please apply! Regards, Michel On Jun 18, 7:19 pm, Michel [EMAIL PROTECTED] wrote: I can confirm that this particular test *sometimes* fails for me also. I also don't know what the cause is. Here is my /proc/cpuinfo. processor : 0 vendor_id : AuthenticAMD cpu family : 6 model : 8 model name : AMD Athlon(tm) XP 2200+ stepping: 1 cpu MHz : 1799.380 cache size : 256 KB fdiv_bug: no hlt_bug : no f00f_bug: no coma_bug: no fpu : yes fpu_exception : yes cpuid level : 1 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 mmx fxsr sse syscall mmxext 3dnowext 3dnow ts bogomips: 3603.04 Michel On Jun 18, 6:38 pm, Jonathan Bober [EMAIL PROTECTED] wrote: I just compiled and tested sage on a machine that I haven't run it on before, and got the following puzzling error: sage -t devel/sage-main/sage/rings/real_mpfr.pyx ** File real_mpfr.pyx, line 1471: sage: RealField(5)(-pi).exact_rational() Expected: -25/8 Got: 1610612736 ** It works fine now, by which I mean, the test passes if I manually run ./sage -t devel/sage-main/sage/rings/real_mpfr.pyx and the following also works correctly: sage: RealField(5)(-pi) -3.1 sage: RealField(5)(-pi).exact_rational() -25/8 Perhaps the error indicates a hardware failure (this is an old, battered laptop) but I thought I would report it anyway. For reference, from /proc/cpuinfo: processor : 0 vendor_id : AuthenticAMD cpu family : 6 model : 6 model name : mobile AMD Athlon(tm) 4 1600+ stepping: 2 cpu MHz : 498.364 cache size : 256 KB fdiv_bug: no hlt_bug : no f00f_bug: no coma_bug: no fpu : yes fpu_exception : yes cpuid level : 1 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 sep mtrr pge mca cmov pat pse36 mmx fxsr sse syscall mmxext 3dnowext 3dnow bogomips: 997.70 I'm running 'make test' again, and might try to do some hardware tests. I'll send another email if anything funny comes up. --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: make test failure (possible solution)
I can confirm that this seems to be what is going on. Usually, when I run ./sage -t devel/sage-main/sage/rings/real_mpfr.pyx all of my memory gets eaten up. It worked just fine once, but never again. And I just tried RR(0).exact_rational() which causes the same problems. On Tue, 2007-06-19 at 09:43 -0700, Michel wrote: William, A while ago I reported that the implementation of RR(0).exact_rational() made some machines run out of memory, giving weird doctest errors. You posted a patch (special casing zero) but I now see in the source of sage-2.6 you forgot to apply it. Can you please apply! Regards, Michel On Jun 18, 7:19 pm, Michel [EMAIL PROTECTED] wrote: I can confirm that this particular test *sometimes* fails for me also. I also don't know what the cause is. Here is my /proc/cpuinfo. processor : 0 vendor_id : AuthenticAMD cpu family : 6 model : 8 model name : AMD Athlon(tm) XP 2200+ stepping: 1 cpu MHz : 1799.380 cache size : 256 KB fdiv_bug: no hlt_bug : no f00f_bug: no coma_bug: no fpu : yes fpu_exception : yes cpuid level : 1 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 mmx fxsr sse syscall mmxext 3dnowext 3dnow ts bogomips: 3603.04 Michel On Jun 18, 6:38 pm, Jonathan Bober [EMAIL PROTECTED] wrote: I just compiled and tested sage on a machine that I haven't run it on before, and got the following puzzling error: sage -t devel/sage-main/sage/rings/real_mpfr.pyx ** File real_mpfr.pyx, line 1471: sage: RealField(5)(-pi).exact_rational() Expected: -25/8 Got: 1610612736 ** It works fine now, by which I mean, the test passes if I manually run ./sage -t devel/sage-main/sage/rings/real_mpfr.pyx and the following also works correctly: sage: RealField(5)(-pi) -3.1 sage: RealField(5)(-pi).exact_rational() -25/8 Perhaps the error indicates a hardware failure (this is an old, battered laptop) but I thought I would report it anyway. For reference, from /proc/cpuinfo: processor : 0 vendor_id : AuthenticAMD cpu family : 6 model : 6 model name : mobile AMD Athlon(tm) 4 1600+ stepping: 2 cpu MHz : 498.364 cache size : 256 KB fdiv_bug: no hlt_bug : no f00f_bug: no coma_bug: no fpu : yes fpu_exception : yes cpuid level : 1 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 sep mtrr pge mca cmov pat pse36 mmx fxsr sse syscall mmxext 3dnowext 3dnow bogomips: 997.70 I'm running 'make test' again, and might try to do some hardware tests. I'll send another email if anything funny comes up. --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] FIRST TIME IN INDIA
Hi, Look whats in the news nowadays!!!...I saw this on a website and found it useful for me , thought it would be helpful for you too.Also send this information to all your friends and to people who would like to have a look at it and take benefit from it. Regards, Priya. --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: make test failure (possible solution)
On 6/19/07, Michel [EMAIL PROTECTED] wrote: William, A while ago I reported that the implementation of RR(0).exact_rational() made some machines run out of memory, giving weird doctest errors. You posted a patch (special casing zero) but I now see in the source of sage-2.6 you forgot to apply it. Can you please apply! OK, I just applied it to the branch I'm working in right now, which will definitely be in the next SAGE release. William --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: FIRST TIME IN INDIA
deleted, reported, and banned. Incidently, there is an option Messages from new members are moderated which I can set. This means that new members might have a delay to their posting. Any thoughts? It would eliminate spam I think. On 6/19/07, jobs 6677 [EMAIL PROTECTED] wrote: Hi, Look whats in the news nowadays!!!...I saw this on a website and found it useful for me , thought it would be helpful for you too.Also send this information to all your friends and to people who would like to have a look at it and take benefit from it. Regards, Priya. --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: FIRST TIME IN INDIA
On 6/19/07, David Joyner [EMAIL PROTECTED] wrote: deleted, reported, and banned. Incidently, there is an option Messages from new members are moderated which I can set. This means that new members might have a delay to their posting. Any thoughts? It would eliminate spam I think. Let's try it out! If users complain, we'll switch back. Having spam on sage-devel is really embarassing. William --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: SD4 photos
Hi folks, My pics are available at http://www.sagemath.org:9001/days4/Pictures Regards, Ifti --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: FIRST TIME IN INDIA
Done (for all three groups). On 6/19/07, William Stein [EMAIL PROTECTED] wrote: On 6/19/07, David Joyner [EMAIL PROTECTED] wrote: deleted, reported, and banned. Incidently, there is an option Messages from new members are moderated which I can set. This means that new members might have a delay to their posting. Any thoughts? It would eliminate spam I think. Let's try it out! If users complain, we'll switch back. Having spam on sage-devel is really embarassing. William --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: make test failure
Michel [EMAIL PROTECTED] writes: I can confirm that this particular test *sometimes* fails for me also. Does it always fail the same way? With the same output, on both machines? Nick --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Re: printing MPolynomialRing
On Jun 19, 4:31 pm, Hamptonio [EMAIL PROTECTED] wrote: I agree, the singular output is nice.I don't use such big rings, but I very often use two blocks: variables and parameters. On Jun 19, 7:26 am, Martin Albrecht [EMAIL PROTECTED] wrote: On Tuesday 19 June 2007 14:55, Martin Albrecht wrote: Hi there, I would like to gather some options on the way multivariate polynomial rings are printed in SAGE. Sorry for replying to myself, I meant to gather opinions not options of course. In case you wondered ... Martin I agree, it looks pretty good and since I create rather large rings with CTC for example I would certainly prefer something like that. Slightly OT: Do you plan to release the Small Scale AES with you mutlivariate crypto system package any time soon? I have some code to create SymbolicData.org output for the CTC examples (which still needs to be cleaned up). I am currently at CoCoA School and next week is MEGA, so I won't be able to play with it for at least another 10 days - so no preassure from me :) Cheers, Michael --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Subject : THE FEEL GOOD FACTOR!
Britains Got Talent * Connie, 6, WOWs Simon Cowell !!! Watch it at http://www.videofortoday.com/?vID=1182081447 --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Inheriting from a Matrix class?
Hi All, I am trying to write a small class which implements symmetric matrices, but I'm unclear how to inherit from sage.matrix.matrix_dense. How can I tell what the initialization does, and how to properly call it? I tried looking at sage.matrix.matrix_integer_dense.pyx to do this, but I'm still having some trouble. I have included the class and errors below. Thanks! -Jon =) -- -- | SAGE Version 2.6, Release Date: 2007-06-02 | | Type notebook() for the GUI, and license() for information.| -- Loading SAGE library. Current Mercurial branch is: qfdevel sage: SymmetricMatrix(ZZ,3, [1,2,3,4,5,6]) --- type 'exceptions.AttributeError'Traceback (most recent call last) /Users/jonhanke/Documents/sage-2.6/ipython console in module() /Users/jonhanke/Documents/sage-2.6/local/lib/python2.5/site-packages/ sage/quadratic_forms/symmetric_matrix.py in __init__(self, R, n, entries) 53 54 ## Run the parent initialization --- 55 Matrix_dense.__init__(self, R) 56 57 ## Set the size of the matrix /Users/jonhanke/Documents/sage-2.6/matrix0.pyx in matrix0.Matrix.__init__() type 'exceptions.AttributeError': 'sage.rings.integer_ring.IntegerRing_class' object has no attribute 'nrows' sage: -- from sage.matrix.matrix_dense import Matrix_dense from sage.rings.integer import is_Integer class SymmetricMatrix(Matrix_dense): SymmetricMatrix() def __init__(self, R, n, entries): Initialize a symmetric matrix of a given size, and possibly with given entries along its (upper-triangular) rows. INPUT: R -- a ring n -- an integer n = 0 entries -- a list of entries in parent of size n*(n+1)/2 EXAMPLES: ## Run the parent initialization Matrix_dense.__init__(self, R) ## Set the size of the matrix if is_Integer(n) and (n = 0): self._nrows = n self._ncols = n else: raise TypeError, Oops! The size + str(n) + must be a non-negative integer. ## Check if entries is a list for the corrent size, and if so, write the upper-triangular matrix if isinstance(entries, list) and (len(entries) == n*(n+1)/2): ind = 0 for i in range(n): for j in range(i, n): self._entries[i+j] = entries[ind] ind += 1 else: raise TypeError, Oops! The entries + str(entries) + must be a list of size n(n+1)/2. --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
[sage-devel] Recursive base extend prototype (for coercion)
Here is a prototype for the tricky part of the coercion (recursive base extension). It seems to catch all the examples I came up with. Please test, and add more examples if needed. I will be rewriting this in py Note that this doesn't work for multivariate polynomials (the tests use recursive univariate polys), but it should work as soon as canonical coercions from ZZ[x] to ZZ[x,y] are implemented and ZZ[x,y].has_coerce_map_from(ZZ[x]) returns true. I've also got bin_op_c mostly worked out for add/sub/mul/div, this recursive base extend is a requirement, so I'll be having a patch soon. The patch essentially adds a step of trying recursive base extension in both directions, and use the result if exactly one of the two work. There is some other stuff with division as well (try ZZ[x](x) / Mod(2,5) to see what I mean), but I think I also have this sorted out. Best, Gonzalo --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~--- bext.py Description: Binary data
[sage-devel] Re: Recursive base extend prototype (for coercion)
A while ago, I wrote a little function that took a multivariate polynomial into a corresponding recursive univariate polynomial. Would people be interested in this? On Tue, 19 Jun 2007, Gonzalo Tornaria wrote: Here is a prototype for the tricky part of the coercion (recursive base extension). It seems to catch all the examples I came up with. Please test, and add more examples if needed. I will be rewriting this in py Note that this doesn't work for multivariate polynomials (the tests use recursive univariate polys), but it should work as soon as canonical coercions from ZZ[x] to ZZ[x,y] are implemented and ZZ[x,y].has_coerce_map_from(ZZ[x]) returns true. I've also got bin_op_c mostly worked out for add/sub/mul/div, this recursive base extend is a requirement, so I'll be having a patch soon. The patch essentially adds a step of trying recursive base extension in both directions, and use the result if exactly one of the two work. There is some other stuff with division as well (try ZZ[x](x) / Mod(2,5) to see what I mean), but I think I also have this sorted out. Best, Gonzalo --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~--~~~~--~~--~--~---
