Re: [sage-combinat-devel] Re: [sage-devel] Re: Re: Re: Re: Re: a problem in the new permutation groups code (and a solution ?)
Helloo Dima !!!
Yesterday I went to walk around the Calanques near the University of
Marseille, and it did me good ! I am now wandering homeless in Paris and
that's another story :-P
But the thing is that I thought a bit about our conversation here
and I think I understand our misunderstanding better. That's only because
Thomas Connor mad me read something about Incidence Geometry a long time
ago :-D
So for a start, it took me some time to accept that you see nothing wrong
-- in a group where all elements of the domain are integers 1, , n --
with wanting to compute the orbit of (1, {1,2}), when of course {1,2} is
not a member of the domain. Of course, now if {1,2} *IS* a member of the
domain then you do not see how to interpret (1, {1,2}) given as input and
everything becomes dark, sad, evil and totally non-beautiful at all.
SO. First, the thing is that GAP apparently does not know how to do that
either. It accepts only a list of things which are at the same level,
that is a tuple (element, element) and not a tuple (element, pair of
elements). That's what I need myself so I don't complain if GAP does not
know better and I would be prettyy glad if this feature could be
exposed for a start. And for this kind of input we know all we have to with
the value of action exactly as GAP already does it.
Then I agree that it would be great to have a way to say g.orbit( (1,
{1,2}) ) and have Sage do all the job. Well, at this level I have no idea
how it should be actualy implemented (I'm interested in the ways but so
ignorant of such things that I probably will not be of much help), but I am
not scared anymore of the interpretation of input : as Volker said earlier
(which I had not noticed then) we could just write some code at the
beginning of orbit which checks that input can never be misnterpreted
(and cache the result of this computation) so that we can be proud of what
we return. And if input can be misinterpreted we would just scream in panic
and raise an IAmClueless error saying so. Which will not happen in your
applications, which will not happen in mine either, and which will never
happen whenever action is defined anyway
Now what you think of it ? That we implement this method for a given value
of action, and think hard of how to extend GAP's features in Sage ?
Have fn ! It's grey in Paris
and everything is expensive, but I have found a couch somewhere for the
next two weeks ;-)
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-combinat-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] Congratulations to IPython
IPython has won the 2012 Free Software foundation award for the Advancement of Free Software ( http://www.fsf.org/news/2012-free-software-award-winners-announced-2). Well deserved! David -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] Compile Python with -D__C99FEATURES__ on Solaris (#14265) needs review
The new doctesting framework (#12415) on Solaris gives lots of warnings like sage -t --long devel/sage/sage/plot/plot.py ** File devel/sage/sage/plot/plot.py, line 236, in sage.plot.plot Failed example: (g1+g2).show(ticks=pi/6, tick_formatter=pi) # show their sum, nicely formatted Expected nothing Got: Warning: invalid value encountered in isinf Warning: invalid value encountered in isinf Warning: invalid value encountered in isinf [...] Warning: invalid value encountered in isinf Warning: invalid value encountered in isinf Warning: invalid value encountered in isinf These warnings are actually harmless and are indirectly caused by the fact that Python doesn't find the isinf() C library function. From spkg/logs/python-2.7.3.p5.log: [...] checking whether isinf is declared... no checking whether isnan is declared... yes checking whether isfinite is declared... no [...] These functions are defined by C99 and Python's configure does find isinf and isfinite when compiled with -D__C99FEATURES__. So we should add a compiler flag to fix this. Needs review: http://trac.sagemath.org/sage_trac/ticket/14265 -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-combinat-devel] Re: [sage-devel] Re: Re: Re: Re: Re: a problem in the new permutation groups code (and a solution ?)
Helloo Dima !!!
Yesterday I went to walk around the Calanques near the University of
Marseille, and it did me good ! I am now wandering homeless in Paris and
that's another story :-P
But the thing is that I thought a bit about our conversation here
and I think I understand our misunderstanding better. That's only because
Thomas Connor mad me read something about Incidence Geometry a long time
ago :-D
So for a start, it took me some time to accept that you see nothing wrong
-- in a group where all elements of the domain are integers 1, , n --
with wanting to compute the orbit of (1, {1,2}), when of course {1,2} is
not a member of the domain. Of course, now if {1,2} *IS* a member of the
domain then you do not see how to interpret (1, {1,2}) given as input and
everything becomes dark, sad, evil and totally non-beautiful at all.
SO. First, the thing is that GAP apparently does not know how to do that
either. It accepts only a list of things which are at the same level,
that is a tuple (element, element) and not a tuple (element, pair of
elements). That's what I need myself so I don't complain if GAP does not
know better and I would be prettyy glad if this feature could be
exposed for a start. And for this kind of input we know all we have to with
the value of action exactly as GAP already does it.
Then I agree that it would be great to have a way to say g.orbit( (1,
{1,2}) ) and have Sage do all the job. Well, at this level I have no idea
how it should be actualy implemented (I'm interested in the ways but so
ignorant of such things that I probably will not be of much help), but I am
not scared anymore of the interpretation of input : as Volker said earlier
(which I had not noticed then) we could just write some code at the
beginning of orbit which checks that input can never be misnterpreted
(and cache the result of this computation) so that we can be proud of what
we return. And if input can be misinterpreted we would just scream in panic
and raise an IAmClueless error saying so. Which will not happen in your
applications, which will not happen in mine either, and which will never
happen whenever action is defined anyway
Now what you think of it ? That we implement this method for a given value
of action, and think hard of how to extend GAP's features in Sage ?
Have fn ! It's grey in Paris
and everything is expensive, but I have found a couch somewhere for the
next two weeks ;-)
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-devel group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] Some enhancements related to padics
Dear Sage lovers, I've recently written several patches/packages related to p-adics in Sage. Here is an overview of what I've done: . an implementation of Frobenius endormophisms over p-adic rings (as morphism - the method x.frobenius() already exists) . an implementation of Newton polygons as a separated class . an implementation of several useful function on polynomials over p-adic rings and fields (like Hensel lift, slope factorization) . an implementation of bounded convergent series over ultrametic balls (this includes in particular power series over rings like Z_p); this patch is undocumented yet . (very early stage) based on some discussions with David Roe, a package implementating a new approch to p-adics (and actually, more generally to inexact elements): the main feature is that approximation and precision are now completely separated objects (which should allow at some point more flexibility). This package also provides a first implementation of lazy p-adics. and hopefully, coming soon (I'm working on this currently): . an implementation of several useful decompositions of matrices over p-adics (like Hermite form, Smith form, LU factorization) together with a special implementation of modules over p-adic rings and vector spaces over p-adic fields All of this is available online on the CETHop website: http://cethop.math.cnrs.fr/prodscient/algos.html (webpage written in french, sorry). Also available are some demo worksheets: https://cethop.math.cnrs.fr:8443/pub/ The page: https://cethop.math.cnrs.fr:8443/ provides an access to a sage session (via the Notebook) where all the above patches are applied. You can then use them inline if you don't want to install them on your computer. If you want an account on this Notebook, please just email and ask me. Until now, I've not submitted these patches to the trac server. I actually would like to have some feedback before. So please, don't hesitate to comment on my work. By the way, I have the vague project to organize Sage Days (about p-adics) in September in Rennes. Could you please tell me if you could be interested and available at that time? Best wishes, --Xavier -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Some enhancements related to padics
On 2013-03-24 12:59, Xavier Caruso wrote: Until now, I've not submitted these patches to the trac server. I actually would like to have some feedback before. If you want comments and feedback, please *do* submit them to Trac, preferably not as one big patch bomb, but separated on multiple tickets. Also: are you aware of http://trac.sagemath.org/sage_trac/ticket/12555 because your patches should be applied on top of that. -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Some enhancements related to padics
On Sun, Mar 24, 2013 at 4:59 AM, Xavier Caruso xavier.car...@normalesup.org wrote: Dear Sage lovers, I've recently written several patches/packages related to p-adics in Sage. Here is an overview of what I've done: . an implementation of Frobenius endormophisms over p-adic rings (as morphism - the method x.frobenius() already exists) . an implementation of Newton polygons as a separated class . an implementation of several useful function on polynomials over p-adic rings and fields (like Hensel lift, slope factorization) . an implementation of bounded convergent series over ultrametic balls (this includes in particular power series over rings like Z_p); this patch is undocumented yet . (very early stage) based on some discussions with David Roe, a package implementating a new approch to p-adics (and actually, more generally to inexact elements): the main feature is that approximation and precision are now completely separated objects (which should allow at some point more flexibility). This package also provides a first implementation of lazy p-adics. and hopefully, coming soon (I'm working on this currently): . an implementation of several useful decompositions of matrices over p-adics (like Hermite form, Smith form, LU factorization) Is there a paper somewhere explaining how the algorithms you've implemented for p-adic numerical analysis work? William together with a special implementation of modules over p-adic rings and vector spaces over p-adic fields All of this is available online on the CETHop website: http://cethop.math.cnrs.fr/prodscient/algos.html (webpage written in french, sorry). Also available are some demo worksheets: https://cethop.math.cnrs.fr:8443/pub/ The page: https://cethop.math.cnrs.fr:8443/ provides an access to a sage session (via the Notebook) where all the above patches are applied. You can then use them inline if you don't want to install them on your computer. If you want an account on this Notebook, please just email and ask me. Until now, I've not submitted these patches to the trac server. I actually would like to have some feedback before. So please, don't hesitate to comment on my work. By the way, I have the vague project to organize Sage Days (about p-adics) in September in Rennes. Could you please tell me if you could be interested and available at that time? Best wishes, --Xavier -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out. -- William Stein Professor of Mathematics University of Washington http://wstein.org -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Congratulations to IPython
On Sun, Mar 24, 2013 at 2:25 AM, David Roe roed.m...@gmail.com wrote: IPython has won the 2012 Free Software foundation award for the Advancement of Free Software (http://www.fsf.org/news/2012-free-software-award-winners-announced-2). Well deserved! Thanks, David! I should add, though, that supposedly the award was not just for IPython, but for the broader scientific Python ecosystem, and I think of Sage as one part of that ecosystem. IPython's value (like all libraries and tools that aren't an end in and of themselves for most of their users) lies in what people can do with it. In as much as Sage has benefited from IPython, then it's also one of the elements behind this award. I know that our interactions with the Sage team, both in terms of ideas and of resources/meetings (William has funded IPython devs to travel to several sprints), has been enormously beneficial to IPython. Cheers, f -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Some enhancements related to padics
Le dimanche 24 mars 2013, Jeroen Demeyer a écrit : If you want comments and feedback, please *do* submit them to Trac, preferably not as one big patch bomb, but separated on multiple tickets. Ok, ok. I will do it. Also: are you aware of http://trac.sagemath.org/sage_trac/ticket/12555 because your patches should be applied on top of that. I was aware about this ticket but I didn't know that it was positively reviewed recently. (By the way, I tried to apply this patch on the top of sage 5.7 and it failed. Should I apply this on the top of sage 5.8? Something else?) Since a large part of my patches use only the external API of p-adics, I think that it should be rather easy to make them compatible with the general framework of templates. --Xavier -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Some enhancements related to padics
Le dimanche 24 mars 2013, William Stein a écrit : . an implementation of several useful decompositions of matrices over p-adics (like Hermite form, Smith form, LU factorization) Is there a paper somewhere explaining how the algorithms you've implemented for p-adic numerical analysis work? Actually, it is not so involved: for Hermite form and Smith form, I just choose at each step the pivot with minimal valuation. I am not completely sure that it's optimal but it works quite well in practice. Concerning LU factorization, I have written the following paper: http://perso.univ-rennes1.fr/xavier.caruso/articles/LU.pdf (see section 2.1.2). --Xavier -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Some enhancements related to padics
On Sun, Mar 24, 2013 at 8:42 AM, William Stein wst...@gmail.com wrote: On Sun, Mar 24, 2013 at 4:59 AM, Xavier Caruso xavier.car...@normalesup.org wrote: Dear Sage lovers, I've recently written several patches/packages related to p-adics in Sage. Here is an overview of what I've done: . an implementation of Frobenius endormophisms over p-adic rings (as morphism - the method x.frobenius() already exists) . an implementation of Newton polygons as a separated class . an implementation of several useful function on polynomials over p-adic rings and fields (like Hensel lift, slope factorization) . an implementation of bounded convergent series over ultrametic balls (this includes in particular power series over rings like Z_p); this patch is undocumented yet . (very early stage) based on some discussions with David Roe, a package implementating a new approch to p-adics (and actually, more generally to inexact elements): the main feature is that approximation and precision are now completely separated objects (which should allow at some point more flexibility). This package also provides a first implementation of lazy p-adics. and hopefully, coming soon (I'm working on this currently): . an implementation of several useful decompositions of matrices over p-adics (like Hermite form, Smith form, LU factorization) Is there a paper somewhere explaining how the algorithms you've implemented for p-adic numerical analysis work? Xavier and I are planning on writing something once we have an implementation in Sage. We currently have a very rough draft, but I haven't been able to put in enough time to the project to make progress recently. together with a special implementation of modules over p-adic rings and vector spaces over p-adic fields All of this is available online on the CETHop website: http://cethop.math.cnrs.fr/prodscient/algos.html (webpage written in french, sorry). Also available are some demo worksheets: https://cethop.math.cnrs.fr:8443/pub/ The page: https://cethop.math.cnrs.fr:8443/ provides an access to a sage session (via the Notebook) where all the above patches are applied. You can then use them inline if you don't want to install them on your computer. If you want an account on this Notebook, please just email and ask me. Until now, I've not submitted these patches to the trac server. I actually would like to have some feedback before. So please, don't hesitate to comment on my work. As Jeroen said, trac is a good place for comments: it's alright if patches you put up there are still in an early stage. Sage Days 47 is this upcoming week, working on transitioning Sage to git. Julian and I are currently using a github repository to collaborate on p-adics in Sage (https://github.com/saraedum/sage/tree/Zq). We'd be happy to give you permissions to push to it. I'm hoping that the state of collaboration on Sage using git will advance a lot in the next week: I'll write an update after the workshop. By the way, I have the vague project to organize Sage Days (about p-adics) in September in Rennes. Could you please tell me if you could be interested and available at that time? I'm definitely interested. Classes in Calgary start on September 9; I would be available between September 3 and September 8. Later in September could work (I can probably find someone to cover for me), but I don't want to miss the first week of classes. On Sun, Mar 24, 2013 at 10:27 AM, Xavier Caruso xavier.car...@normalesup.org wrote: Le dimanche 24 mars 2013, Jeroen Demeyer a écrit : If you want comments and feedback, please *do* submit them to Trac, preferably not as one big patch bomb, but separated on multiple tickets. Ok, ok. I will do it. Also: are you aware of http://trac.sagemath.org/sage_trac/ticket/12555 because your patches should be applied on top of that. I was aware about this ticket but I didn't know that it was positively reviewed recently. (By the way, I tried to apply this patch on the top of sage 5.7 and it failed. Should I apply this on the top of sage 5.8? Something else?) Since a large part of my patches use only the external API of p-adics, I think that it should be rather easy to make them compatible with the general framework of templates. Excellent. Julian and I were were working off sage 5.9-beta0, but the patches should apply without much trouble against 5.8. David -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] Re: Compile Python with -D__C99FEATURES__ on Solaris (#14265) needs review
Jeroen Demeyer wrote: The new doctesting framework (#12415) on Solaris gives lots of warnings like sage -t --long devel/sage/sage/plot/plot.py ** File devel/sage/sage/plot/plot.py, line 236, in sage.plot.plot Failed example: (g1+g2).show(ticks=pi/6, tick_formatter=pi) # show their sum, nicely formatted Expected nothing Got: Warning: invalid value encountered in isinf Warning: invalid value encountered in isinf Warning: invalid value encountered in isinf [...] Warning: invalid value encountered in isinf Warning: invalid value encountered in isinf Warning: invalid value encountered in isinf These warnings are actually harmless and are indirectly caused by the fact that Python doesn't find the isinf() C library function. From spkg/logs/python-2.7.3.p5.log: [...] checking whether isinf is declared... no checking whether isnan is declared... yes checking whether isfinite is declared... no [...] These functions are defined by C99 and Python's configure does find isinf and isfinite when compiled with -D__C99FEATURES__. So we should add a compiler flag to fix this. Needs review: http://trac.sagemath.org/sage_trac/ticket/14265 ... while now also requiring _ctypes to properly import breaks the build of the Python spkg on at least Solaris SPARC with GCC 4.7.x (which apparently is a Python bug, but previously didn't hurt). Slightly related: IPython not being able to import _ctypes meanwhile breaks a lot of doctests because of (IMHO superfluous) warnings regarding %gui not being available. (This is #14309.) Requiring _ctypes is unrelated to the purpose of the ticket, AFAIK. -leif -- () The ASCII Ribbon Campaign /\ Help Cure HTML E-Mail -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] numpy 1.7.0 upgrade ticket is ready for review
On Fri, Mar 22, 2013 at 10:24 AM, Francois Bissey francois.bis...@canterbury.ac.nz wrote: After much time spent finding why numpy 1.6.x didn't like sage and some nice cooperation with numpy upstream we have an upgrade path for numpy. It couldn't have happened before the merging of the new doctest framework. Numpy 1.7.0 exposed at least one instance where the old one was broken. So http://trac.sagemath.org/sage_trac/ticket/11334 is now ready for review on top of sage-5.9.beta0 or later. Please let us know if you run into any problems with numpy 1.7.0. Ondrej P.S. I think you should switch to github or bitbucket with Sage for pull requests, it's so much easier for somebody like me to see what the ticket #11334 is doing. The way I am doing it is to click on each patch one by one and try to remember the total changes in my head to see if it makes sense as a whole. -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] GSoC'13: Call for Project Proposals
Hello Sage Developers Like last year, Sage will try to be part of GSoC 2013 again. For this, I'm preparing the application which I'll have to submit until the end of this week. What's missing for that are project proposals for students. These proposals are as essential as the application and need to be on a public page by the end of this week, too! They should outline briefly what the project idea is about, how difficult it is and what prerequisites the student should have to be able to do it. Most importantly though, a mentor and a backup-mentor need to be assigned, who are actually guiding the student throughout the summer. The timetable is here: https://google-melange.appspot.com/gsoc/events/google/gsoc2013 Mentor guide: http://en.flossmanuals.net/GSoCMentoring/what-makes-a-good-mentor/ Harald -- You received this message because you are subscribed to the Google Groups sage-devel group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
