You can subscribe to this list here.
2003 |
Jan
|
Feb
|
Mar
|
Apr
(5) |
May
|
Jun
|
Jul
|
Aug
(2) |
Sep
|
Oct
|
Nov
|
Dec
|
---|---|---|---|---|---|---|---|---|---|---|---|---|
2004 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
(5) |
Aug
|
Sep
|
Oct
|
Nov
(7) |
Dec
(7) |
2005 |
Jan
(2) |
Feb
|
Mar
(2) |
Apr
|
May
(3) |
Jun
|
Jul
(7) |
Aug
|
Sep
(1) |
Oct
(4) |
Nov
|
Dec
(4) |
2006 |
Jan
|
Feb
(2) |
Mar
(1) |
Apr
(1) |
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
(1) |
Dec
|
2007 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
(5) |
Oct
|
Nov
|
Dec
|
2008 |
Jan
|
Feb
(2) |
Mar
|
Apr
(1) |
May
|
Jun
(4) |
Jul
|
Aug
|
Sep
(1) |
Oct
|
Nov
(5) |
Dec
|
2009 |
Jan
(2) |
Feb
(1) |
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2010 |
Jan
|
Feb
(1) |
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2014 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
(1) |
Sep
|
Oct
|
Nov
|
Dec
|
From: Nizan K. <ni...@wi...> - 2010-02-22 10:11:19
|
Hi all, I've been trying to install the package on a Matlab-installed Mupad on a Linux (Ubuntu) machine. I tried working with the binary files, as the ./configure couldn't find the mupad installation, even though I specified where matlab installed it. When I tried putting the package in the /mupad_root/packages or in my packages library (which I defined from the notebook), the package didn't update. When I tried running from the notebook I got package("Mupad-Combinat") Error : Domain key already exists [newDomain]; during evaluation of '_constructor'; How do I get this to work? Thanks Nizan. |
From: Nicolas M. T. <Nic...@u-...> - 2009-05-01 17:58:03
|
Dear *-Combinat users and developers, Just a reminder about: *-Combinat 2009 International Sage Workshop on Free and Practical Software for Algebraic Combinatorics July 25-29 (right after FPSAC) RISC, Linz, Austria http://wiki.sagemath.org/combinat/FPSAC09 If you want to attend, please register using the RISC conference management website (see the link from the wiki). If you are registering to FPSAC or some other conference of the RISC summer, further registering to *-Combinat is a single click. Please let us know if you have suggestions of persons we should try to invite. Besides the main general-purpose Sage-Combinat tutorial, we will run short tutorials focused on specific features, with a (flexible) format like 10 minutes of presentation; 20 minutes of exercises. Here are some ideas. Please feel free to suggest others, especially around some features you developed yourself! * Posets (Franco?) * Words (Franco?) * Species and decomposable classes in Axiom / Aldor / Maple / MuPAD (Mike? Ralf? Martin?) * guess in Axiom / Aldor (Martin?) * Coxeter groups, crystals (Anne?) * Symmetric Functions, Non Commutative Symmetric Functions, using algebras with several basis (Jason? Nicolas?) * categories/parents/elements (Nicolas) * Implementing enriched enumerated sets, (e.g. how to enrich the partitions of 5 with a semi-groups structure) (Florent?) * Implementing new combinatorial objects (?) * Implementing new (Hopf) Algebras with bases (Florent? Nicolas?) * Sharing code with the Sage-combinat patch server I just posted this list on the wiki; editing it there is the preferred way. Best, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2009-02-02 11:11:04
|
Dear *-Combinat users and developers, I have just created a web page for: *-Combinat 2009 International Sage Workshop on Free and Practical Software for Algebraic Combinatorics July 25-29 (right after FPSAC) RISC, Linz, Austria http://wiki.sagemath.org/combinat/FPSAC09 Please feel free to edit, or contact me by e-mail for comments! In particular, fill in your name if you think about participating, need funding, or otherwise have suggestions of talks or other activities. Hoping to see many of you out there! Best regards, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2009-01-16 18:02:57
|
Dear all, The next sage-combinat days will occur in Orsay during the week from 25th to 30th of January 2009. If you have any preference for the beginning or the end of the week, let us know soon! I updated the wiki accordingly: http://wiki.sagemath.org/combinat/SageCombinatWorkshopOrsay I'll put the lodging information there. Most likely, we will rent a house for all of us, and hopefully Orsay will pay for it. Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2009-01-05 10:08:04
|
Dear Sage-Combinat and MuPAD-Combinat developers, We have this project of running Sage Combinat days in Orsay shortly, with purpose to help all the MuPAD-Combinat developers start migrating to Sage: http://wiki.sagemath.org/combinat/SageCombinatWorkshopOrsay If you are interested, please let us know as soon as possible either by e-mail or by editing this wiki page! So far, only Sébastien, Nicolas^2, Franco and Michael answered, so I am wondering whether it's worth pursuing this idea. Florent? Jean-Christophe? Frédéric? Patrick? Éric? Others? Best regards, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2008-11-25 16:10:08
|
Dear Conrado, > I submitted a paper to FPSAC and if accepted (I hope so), I'll > probably attend the *-Combinat event Great! > Why not OSSAC = Open Source Software for Algebraic Combinatorics > ... Free means gratis, you have not to pay, right? I think the > emphasis should be on the source being open, even if you have to pay > for it, do we agree? I take Free as in Free Software, not Free Beer. If I wanted to be pedantic I would even go for Libre Software. But anyway, here the main reason for including Free at all is for the FPSAC pun. In the rush, I ended up choosing the following for the RISC summer events poster: *-Combinat 2009 International Sage Workshop on Free and Practical Software for Algebraic Combinatorics, July 25-29 Not perfect, but we will make the intention clearer on the web site. > Sage will probably be the star of the event, but I think it is good > to have a broader scope ... Any open source package for > combinatorics is OSSAC even if the system for which the package is > meant is not. Yes. Everybody implementing (algebraic) combinatorics is definitely more than welcome. Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Conrado M. <co...@ls...> - 2008-11-25 15:53:19
|
On Thursday 20 November 2008, Nicolas M. Thiery wrote: > Dear *-Combinat developers, > > Thanks to the kind help of Ralf Hemmecke, Burcin Erocal, and Michael > Abshoff, and the support of Peter Paule, it sounds like we will be > able to run a *-Combinat workshop at RISC, right after FPSAC 2009: > > *-Combinat 2009 > Free Software for Algebraic Combinatorics > Users and Developers Workshop > July 25-29, 2009 > > We have to fix quickly the rough organization details, and need your > feedback on the following questions: > > - Who is interested in participating? How many days? > (in principle; no commitment yet) > > - How long a workshop? Should we extend to, say, July 30, to feel a > bit more free to relax a bit on Sunday after a crazy FPSAC week? > > - Suggestions to improve the title above: > - Michael thinks it should include Sage, and I fully agree, even > though I want to leave the door wide open for our friends from > sister projects. > Suggestions? > Maybe an extra line "with a slant toward Sage"? > Or replace *-Combinat by (Sage)-Combinat? > - Should we dare to replace line 2 by > Free and Powerful Software for Algebraic Combinatorics > for a FPSAC pun? > > > Ralf: I am not so sure about the actual content. What is planned? > > Nothing very precise yet: helping former MuPAD-Combinat users to > switch to Sage, getting new users and developers on board, design > discussions, coding sprints. I had in mind few preplanned talks (a > general Sage talk, one for Sage-Combinat, probably some presentations > of specific packages (like one on species). And improvised technical > talks whenever needed. But I haven't though much about this, so it's > wide open to other ideas! > > Nicolas > > PS: Ralf, others, please feel free to forward to whoever you might see > fit. > > -- > Nicolas M. Thiéry "Isil" <nt...@us...> > http://Nicolas.Thiery.name/ > > ------------------------------------------------------------------------- > This SF.Net email is sponsored by the Moblin Your Move Developer's challenge > Build the coolest Linux based applications with Moblin SDK & win great prizes > Grand prize is a trip for two to an Open Source event anywhere in the world > http://moblin-contest.org/redirect.php?banner_id=100&url=/ > _______________________________________________ > Mupad-combinat-users mailing list > Mup...@li... > https://lists.sourceforge.net/lists/listinfo/mupad-combinat-users > Dear all I submitted a paper to FPSAC and if accepted (I hope so), I'll probably attend the *-Combinat event . Why not OSSAC = Open Source Software for Algebraic Combinatorics ... Free means gratis, you have not to pay, right? I think the emphasis should be on the source being open, even if you have to pay for it, do we agree? Sage will probably be the star of the event, but I think it is good to have a broader scope ... Any open source package for combinatorics is OSSAC even if the system for which the package is meant is not. Best regards Conrado |
From: Nicolas M. T. <Nic...@u-...> - 2008-11-24 20:29:39
|
Dear Ralf, > For the title: > > *-Combinat 2009 > Free and Powerful Software for Algebraic Combinatorics > Users and developers workshop, with a slant toward Sage > July 25-29, 2009 > > If at all possible with the F P S A C initials highlighted :-) Btw: if at all still possible, please replace Powerful by Practical (or something better). <rant> It may suggest that I/we *claim* that Sage-Combinat is powerful. I certainly strive at making Sage-Combinat powerful, and will also attempt to prove it by cool demos. But I am not the one to judge on the success. Well, practical is also some sort of bragging, but to a lesser extent; and it also is more precise as an intention: of course you want your soft to be powerful. Being practical is a less utterly obvious goal, when it comes to the balance with beauty and robustness. </rant> Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2008-11-24 17:04:50
|
Dear Ralf, dear *-combinat developers, > What is your decision for the workshop? Sage-devel-combinat was not > very responsive. Do you still plan to have this workshop? Well, yes. I know the guys out there; they either did not take the time to answer (Florent, hmm?), or are afraid to make plans too much in advance, in particular before knowing whether their FPSAC paper is accepted, etc. I also very much hope to attract people not yet on the lists. > If there are only 4-5 people coming, I don't have a good argument > for convincing the poster producers to put it on the RISC-Summer > poster. Sure. Altogether, I made my own private list (you are on it :-)) and I am ready to bet for minimum 10 people, and probably more like 15-20. But of course, it is hard to predict. So, please keep responding! > I need information (at least for the poster) today. Sorry for my late answer. I hope it's still time. Take whatever decision you see appropriate w.r.t. the above figures. For the title: *-Combinat 2009 Free and Powerful Software for Algebraic Combinatorics Users and developers workshop, with a slant toward Sage July 25-29, 2009 If at all possible with the F P S A C initials highlighted :-) Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2008-11-20 12:38:07
|
Dear *-Combinat developers, Thanks to the kind help of Ralf Hemmecke, Burcin Erocal, and Michael Abshoff, and the support of Peter Paule, it sounds like we will be able to run a *-Combinat workshop at RISC, right after FPSAC 2009: *-Combinat 2009 Free Software for Algebraic Combinatorics Users and Developers Workshop July 25-29, 2009 We have to fix quickly the rough organization details, and need your feedback on the following questions: - Who is interested in participating? How many days? (in principle; no commitment yet) - How long a workshop? Should we extend to, say, July 30, to feel a bit more free to relax a bit on Sunday after a crazy FPSAC week? - Suggestions to improve the title above: - Michael thinks it should include Sage, and I fully agree, even though I want to leave the door wide open for our friends from sister projects. Suggestions? Maybe an extra line "with a slant toward Sage"? Or replace *-Combinat by (Sage)-Combinat? - Should we dare to replace line 2 by Free and Powerful Software for Algebraic Combinatorics for a FPSAC pun? > Ralf: I am not so sure about the actual content. What is planned? Nothing very precise yet: helping former MuPAD-Combinat users to switch to Sage, getting new users and developers on board, design discussions, coding sprints. I had in mind few preplanned talks (a general Sage talk, one for Sage-Combinat, probably some presentations of specific packages (like one on species). And improvised technical talks whenever needed. But I haven't though much about this, so it's wide open to other ideas! Nicolas PS: Ralf, others, please feel free to forward to whoever you might see fit. -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2008-09-23 10:41:53
|
Dear MuPAD-Combinat users and developers, I have just compiled a preliminary list of publications acknowledging MuPAD-Combinat. No less of 41 of them! http://mupad-combinat.svn.sf.net/viewvc/mupad-combinat/trunk/MuPAD-Combinat/Papers/MuPAD-Combinat.bib Thanks to all the authors! This will be a major asset to emphasize the role of MuPAD-Combinat. I'll also include it in my habilitation thesis which I'll submit in a couple days :-) I mostly compiled this list a full text search on ArXiV (+ some entries I knew of directly). Please have a quick look at your entries, and let me know if: - some entry is missing - some entry is outdated (i.e. you have a better bibtex for it) - some entry should not be there Those with svn access, please edit directly the file from: Combinat/Papers/MuPAD-Combinat.bib Thanks in advance! Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2008-06-21 06:15:12
|
> I would like to thank all of you for the time we worked together. It > really has been an interesting cooperation. Yeah, it was fun! > and wish all the best to you and your project for the future. Thanks! > Hope to meet you again. We surely will! Our two cents of expertise will always be at your service. We should keep in touch and make sure to keep sharing and exchanging anything we can (design ideas, doc, tests, ...). And of course some more juggling props :-) Cheers, Nicolas -- Nicolas M. Thiery "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Christopher C. <cc...@sc...> - 2008-06-20 12:19:45
|
Nicolas M. Thiery wrote: > After months of discussions and experiments, it was time to draw the > conclusion: there is an enthusiastic consensus to go for it, and join > forces with the exciting Sage project! I would like to thank all of you for the time we worked together (more tightly at times, more loosely at others) and wish all the best to you and your project for the future. It really has been an interesting cooperation. Hope to meet you again. -- SciFace Software GmbH & Co. KG Technologiepark 11 Tel: ++49 (0)5251 1843000 D-33100 Paderborn Fax: ++49 (0)5251 1843010 Deutschland Web: www.sciface.com Sitz der Gesellschaft: Paderborn Registergericht Paderborn HRA 2080 Ust.-ID Nr.: DE 187992139 Persönlich haftende Gesellschaft: SciFace Software Verwaltungsgesellschaft mbH Registergericht Paderborn HRB 2924 Geschäftsführer: Dr. Oliver Kluge |
From: Nicolas M. T. <Nic...@u-...> - 2008-06-20 06:30:45
|
Dear MuPAD-Combinat developers and users, After months of discussions and experiments, it was time to draw the conclusion: there is an enthusiastic consensus to go for it, and join forces with the exciting Sage project! The transition is going to be a massive investment: seven years of hard work from all of us to port over! But if we share again the efforts we can do it, and even do it relatively quickly. We gained a lot of experience since 2000: most of the design is now pretty clear (hem ... at least in our heads), which should make the transition much quicker. Mike Hansen by himself did the amazing job of translating 25% of our code in one year! We should see this as a great opportunity to review thoroughly all our code: any software needs a complete rewrite from time to time. And in the long run, there is a lot to gain: - We will for the first time have a bottom-up open-source environment for algebraic combinatorics! Finally! - We will join a much larger community of enthusiastic developers: Mike, Dan^2, Justin, Kurt, Gregg, ... - We won't have to worry anymore about releases, compilation, portability, ... Thanks Michael for relieving us from this! - We will have under our fingertips all the blazingly fast specialized libraries we have always dreamed of (linbox, singular, ...), and all the power of a widely used general purpose language. Think optimized data structures, string or IPC libraries, cython ... - No more broken emacs mode, hairy doc compilations :-) The bottom line is: more time for research, which is our primary goal. In the coming days, we will start building a roadmap by posting tickets on Sage trac for the features we want to port. Some pointers: - http://mupad-combinat.sourceforge.net/Wiki/Sage - http://wiki.sagemath.org/combinat/ - http://sagetrac.org/sage_trac/milestone/sage-combinat/ Finally, we would like to take this occasion to thank the MuPAD developers for their continuous support throughout the years of our fruitful collaboration with them. We owe it to them to leave the MuPAD-Combinat code in a good state so that they can integrate as much as possible into the MuPAD library. We will really appreciate your help for the final stable release! Florent and Nicolas -- Nicolas M. Thiery "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2008-06-10 16:48:38
|
Dear Vladimir, > after a while I address you with a question about mupad once > again. You are welcome! > Are there by chance ready routines that allow to work with > *-algebras (at least compute something in free *-algebras) - that > is, associative algebras with an involution * - so in addition to > associativity, we have the reduction rule (ab)^*=b^* a^* for all > a,b. (A free *-algebra with n generators as an associative algebra > is the free algebra with 2n generators a_i, a_i^*, and the obvious > involution [which is uniquely extended from generators to the whole > algebra].) We have a few finite dimensional Kac algebra implemented, and some generic functions (mostly in the context of involutive Hopf algebras) that take advantage of the existence of the involution (isUnitary, is2Cocycle, coboundary, is2PseudoCocycle). That's all. But its easy to define your own involution. For example: domain FreeAlgebraWithInvolution(R = Dom::ExpressionField()) category Cat::AlgebraWithBasis(R); inherits Dom::FreeModule(combinat::words, R); oneBasis := []; mult2Basis := dom::term @ _concat; involutionBasis := word -> dom::term(revert(map(word, conjugate))); end_domain: >> F := FreeAlgebraWithInvolution() >> f := F[a,b,c] + (2*x*y+1) * F[c,d] B([a, b, c]) + (2 x y + 1) B([c, d]) >> f::involution() _ _ _ _ _ _ _ (2 x y + 1) B([d, c]) + B([c, b, a]) >> (f*f::involution()) _ _ _ _ _ _ (2 x y + 1) B([c, d, c, b, a]) + B([a, b, c, c, b, a]) + _ _ _ _ _ _ _ _ (2 x y + 1) (2 x y + 1) B([c, d, d, c]) + (2 x y + 1) B([a, b, c, d, c]) This assumes that the ground field knows how to conjugate its elements appropriately; here notice that x,y are in the field of expressions which is commutative. Note also that you can use conjugate(f) instead of f::involution(). I don't know if this is a desirable feature from a naming point of view; what do you think? Btw: your point of view on http://mupad-combinat.sourceforge.net/Wiki/Sage is very much welcome! Best regards, Nicolas -- Nicolas M. Thiery "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2008-04-19 07:12:52
|
Dear MuPAD-Combinat community, Time is running, and it's becoming time to take a decision about switching to Sage or not: among other things, Mark Shimozono will be coming at the end of May at Davis to start working on it, and we have two students here ready to start programming in either system; also there is currently parallel development in sage and MuPAD-Combinat for root systems and crystals which makes things messy. So please (re)check out, update, and put feedback on: > http://mupad-combinat.sourceforge.net/Wiki/Sage Kind regards, Nicolas -- Nicolas M. Thiery "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Francois D. <fra...@un...> - 2008-02-13 19:33:35
|
Dear Nicolas, > In short, I have been amazed by the dynamism of the growing SAGE > community. Furthermore, our experiments (partial reimplementation of > our crystal code) seem to indicate that there would be no major > technical issues to port our code: most of the idioms and paradigms we > use have some natural equivalent. On the other hand, porting 7 years > worth of work in MuPAD, and more importantly migrating the community > will be a lot of work and worst may cause the loss of users and > developers. I confirm that the community looks very dynamic and really want to produce a software for a large spectrum of researchers. They seem to have these critical weight which permits to convince people using our stuff. > Now is the time to take a decision: > > - Should we switch to SAGE? I have not a lot of background on the development of computer algebra system and I was not there at the beginning of the project MuPAD-Combinat but my feeling is that it can be a good idea to switch and try to catch the train. > - Would you be ready to invest some time into learning a new system? No problem for me and I am learning python since 2 months. > - Would you be ready to invest some time into the porting itself? I can participate to the porting of the Symmetric Functions part with Mike Hansen and the stuff around ModuleWithSeveralBases. > - What are the features that you would need to be ported before > you switched? Mike has already done a good job ! > - As Anne suggested, we have an opportunity now, since Jason, Mike, > Anne and myself are altogether at MSRI, and Florent, > Jean-Christophe and Fran�ois will visit us at some point. > I plan to work deeper on symmetric functions with Mike Hansen during the workshop at MSRI > To do list (Mike, please update!): > > - Symmetric functions [ 25%] > - k-Schur & the like [ 0%] I think k-Schur functions can be almost done at MSRI with Mike. Francois |
From: Nicolas M. T. <Nic...@u-...> - 2008-02-13 03:55:18
|
Dear MuPAD-Combinat community, This e-mail starts an essential discussion for the future of MuPAD-Combinat: Should we switch to SAGE? Please read carefully, and get involved! SAGE is a completely open source mathematical system which was launched around 2004 by William Stein. It's based on a general purpose language (python), and readily has a large range of functionality thanks to the integration of existing components (GMP, GAP, singular, linbox, R, just to name a few): http://www.sagemath.org/ One year ago, we got contacted by Mike Hansen. Since then, he has ported 30k lines of code from MuPAD-Combinat into SAGE. With Fran�ois, Jason, and Anne, we were invited at the SAGE days 7 last week in Los Angeles (see http://mupad-combinat.sourceforge.net/#sage_days_7 for my presentation slides). Our goal was to play hard with the system and discuss seriously with the SAGE developers to evaluate how good an alternative SAGE would be. This is a report about it. In short, I have been amazed by the dynamism of the growing SAGE community. Furthermore, our experiments (partial reimplementation of our crystal code) seem to indicate that there would be no major technical issues to port our code: most of the idioms and paradigms we use have some natural equivalent. On the other hand, porting 7 years worth of work in MuPAD, and more importantly migrating the community will be a lot of work and worst may cause the loss of users and developers. Now is the time to take a decision: - Should we switch to SAGE? - If yes, what should be the time line? The answer is far from clear to me, and anyway this is really a decision that we have to take all together. There are lots of pros and cons, which I have tried to summaries below. Your feedback is essential. Please answer by e-mail, or edit our Wiki: http://mupad-combinat.sourceforge.net/Wiki/Sage - Would you be ready to invest some time into learning a new system? - Would you be ready to invest some time into the porting itself? - What are the features that you would need to be ported before you switched? - What are, for you, the prominent pros and cons of both platforms? - Altogether, do you think we should switch? Independently of when the switch would occur, here is my feeling about the time line: - We should leave MuPAD-Combinat in a good state. If not just so that the MuPAD people can reuse whatever they see fit in there. We owe them this for all the support they provided us. - We don't necessarily need to switch all at the same time. But none of us want to have one foot in each system, even if the sage-MuPAD interface may level things a bit. - As Anne suggested, we have an opportunity now, since Jason, Mike, Anne and myself are altogether at MSRI, and Florent, Jean-Christophe and Fran�ois will visit us at some point. ------------------------------------------------------------------------------ Here is a summary of pros and cons (please edit!) Development model and community: + Completely open source + Free (as in free beer) + (Hyper)Active fast growing community, with members in all areas of mathematics + Regular SAGE days meetings (3 more planned for 2008, including one in France) + Excellent community organization (see sagetrac.org) + A new release comes out quite often (about every two weeks) + Releases are managed by a release manager which is paid for this, and takes administrative burden away (think running tests, making sure everything builds on all platforms, ...) + The quality of the code is enforced by systematic peer-reviews before integration into SAGE itself. This may motivate people to submit more stable/correct/easy-to-read/tested/documented code. + Mercurial distributed version control (better than subversion when it comes to have several lines of development in parallel). - A Windows version is not yet fully available! What about the long run? Will they manage to continue grow at the same speed? Will the NSF/other funds follow? Documentation: + easier to write + close to the code (written in the source file, within each function) + the doc does compile easily on all platforms - Not as structured as in MuPAD (latex instead of XML) The platform by itself wont impose high quality standards - syntactic tests instead of semantic tests needs to update the results if the pretty printing changes Tests: + close to the code (as the doc) Technical level: + Python has a huge community. In particular: + The interpreter, debugger, ... have been highly optimized and debugged + There are thousands of general purpose python libraries + Continuations (yield) which makes it much easier to write generators. However: it is not sure that you can do copies of those generators and we use this intensively (see generators::subset) + parent/element: sets are objects like the others (see the discussion about posets last June) + Cython compiler: low level critical sections in python can be compiled without rewrite into C (up to some restrictions). It can be further optimized by using C-types instead of python types (think integer lists lex tools). + much easier integration of external C/C++ code (can drop MAPITL) - some issues with multiple inheritance - no standard mantra for input and output type checking - the coercion model may need some adaptation To do list (Mike, please update!): - Basic combinatorial classes [ 75%] - Decomposable objects [ ] (needs complete rewrite anyway) - Symmetric functions [ 25%] - k-Schur & the like [ 0%] - Root systems / ... [ 10%] - Crystals [ 5%] - Free modules & such [ 0%] - Algebra (desosseur, ...) [ 0%] - Operads [ 0%] - Linbox interface [100%] (compares to 10% in MuPAD) - GAP interface [100%] (compares to 1% in MuPAD) - Interface for fast Gr�bner basis [100%] (compares to 0% in MuPAD) - Nauty [100%] - Symmetrica [ 60%] - GLIP Deprecated by Robert's generic code - dot2tex [ 10%] Delegated to the SAGE graph theorists - Database access [100%] - MachineIntegerListsLex [ 0%] Will be easy via cython - Rigged configurations [ 0%] -- Nicolas M. Thiery "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2007-09-27 05:27:05
|
Dear MuPAD-Combinat developers and users, I have made just commited the following change which may be delicate, but hopefully you will like it. Feedback more than welcome. operators::tensor now accepts either domain elements (in which case it returns and element of the tensor product of thedomains), domains, or morphisms (it does not use the overloaded operator operators::tensor2). So, now you can do things like: operators::setTensorSymbol("#"): S := examples::SymmetricFunctions(): // Building tensor elements: >> S::s[3] # S::e[1] # S::p[4,2] s[3] # e[1] # p[4, 2] // Using tensor products of morphisms >> (S::p::id # S::h::antipode) (S::p[2] # S::h[3]) - p[2] # h[1, 1, 1] + 2 p[2] # h[2, 1] - p[2] # h[3] // Note: you can't just do: >> (id # S::h::antipode) (S::p[2] # S::h[3]) Error: Wrong type of 1. argument (type 'Type::ListOf(DOM_DOMAIN)' expected, // because # needs to know the source and image set of both morphisms. // Checking a counit: >> counit := S::p::mu @ (S::p::id # S::p::antipode) @ S::p::coproduct: >> counit(S::p::one) p[] >> counit(S::p[3,2]) 0 // Checking coassociativity >> phi := (S::p::coproduct # S::p::id) @ S::p::coproduct - (S::p::id # S::p::coproduct) @ S::p::coproduct: >> phi(S::p[5,4,3]) 0 // Conversions between tensor spaces >> (S::s # S::s) (S::p[3] # S::p[4]) - s[1, 1, 1] # s[1, 1, 1, 1] + s[1, 1, 1] # s[2, 1, 1] - ... // The bad news is that, you can't yet do: >> (S::s # S::s) (S::p[3] # S::h[4]) Error: illegal arguments [(Dom: // This would indeed require a conversion to be declared from // S::p # S::h to S::s # S::s // The good news is that you can nevertheless do: >> (S::s@S::p::id # S::s@S::h::id) (S::p[3] # S::h[4]) s[1, 1, 1] # s[4] - s[2, 1] # s[4] + s[3] # s[4] // In the later case, you are constructing the tensor product // of two morphisms, and # is able to figure out that // S::s @ S::p::id is a morphism from S::p to S::s, and // deduce the source and image set of the result. Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Nicolas M. T. <Nic...@u-...> - 2007-09-24 06:43:30
|
> less. But using less -R and, for some characters, a UTF-8 locale. Thanks Christopher for the precision! See Mike: I told you the big guys would pop out of the blue when we are really too incompetent :-) Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Christopher C. <cc...@sc...> - 2007-09-20 06:12:26
|
Mike Zabrocki wrote: > Also after I recompiled my ascii documentation it seems that there > are new characters that even "less" doesn't recognize. What kind of > reader is MuPAD supposed to be using if it generates these weird > characters? less. But using less -R and, for some characters, a UTF-8 locale. -- SciFace Software GmbH & Co. KG Technologiepark 11 Tel: ++49 (0)5251 640751 D-33100 Paderborn Fax: ++49 (0)5251 640799 Deutschland Web: www.sciface.com Sitz der Gesellschaft: Paderborn Registergericht Paderborn HRA 2080 Ust.-ID Nr.: DE 187992139 Persönlich haftende Gesellschaft: SciFace Software Verwaltungsgesellschaft mbH Registergericht Paderborn HRB 2924 Geschäftsführer: Dr. Oliver Kluge |
From: Nicolas M. T. <Nic...@u-...> - 2007-09-19 18:07:33
|
Hi Mike, > I can find the instructions on how to compile the documentation, but > I am trying to find instructions on how to run the test files. > Is this on the wiki too? Indeed; see section Tests on http://mupad-combinat.sf.net/Wiki/ProgrammingTipsAndTricks Well, I hope the wiki will be working today ... Speaking of this: in case you would volunteer to migrate our broken wiki to something more stable (typically the sourceforge-provided wiki engine), here are some pointers: - I have enabled the sourceforge wiki engine: http://mupad-combinat.wiki.sourceforge.net/ Currently, it is visible from anyone (but there are no links to it from our web page), and anyone of the mupad-combinat developers can edit it. - The database for our wiki appears to be corrupted; I have tried to extract its raw data. You will find it in MuPAD-Combinat/Wiki-Text after a svn update. - You probably don't need that, but just in case: To login on sourceforge shell servers: ssh shell.sf.net The database is in: /tmp/persistent/mupad-combinat/phpwiki-database/wiki_pagedb.gdbm The web server is in: /home/groups/m/mu/mupad-combinat/htdocs - What remains to do: - Check the markup syntax difference between the old wiki and the new one - Take the files of the old wiki in Wiki-Text (I can update those in case something changes in the old wiki in the mean time). Double check that no data is missing Update the markup Import them into the new wiki > Also after I recompiled my ascii documentation it seems that there > are new characters that even "less" doesn't recognize. What kind of > reader is MuPAD supposed to be using if it generates these weird > characters? In principle it should work with less; but there may be a bug. Now, don't bother too much about it: Christopher has recently written an XSL style file to directly produce the ascii documentation from the mupdoc file (instead of going through mupad graphical interface -> html -> ascii + hacks). So the problem is likely to disappear once I take the time to integrate this into our build system. Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |
From: Mike Z. <zab...@ma...> - 2007-09-19 15:17:42
|
I can find the instructions on how to compile the documentation, but I am trying to find instructions on how to run the test files. Is this on the wiki too? Also after I recompiled my ascii documentation it seems that there are new characters that even "less" doesn't recognize. What kind of reader is MuPAD supposed to be using if it generates these weird characters? -Mike |
From: Christopher C. <cc...@mu...> - 2006-11-30 08:50:52
|
Salvete, this may be trivial to combinatorists (I actually hope so), but I am none, so I don't see it right away: Given a finite list of finite sets, is there some short incantation that gives me the nontrivial intersections of these lists, preferably without computing all 2^n combinations of sets and intersecting them? I.e., a faster way of doing intersections := proc(l : Type::ListOf(DOM_SET)) local i, ret; begin ret := select(combinat::subsets(nops(l)), s -> nops(s) > 1); ret := map(ret, s -> [s, _intersect(l[i] $ i in s)]); ret := select(ret, s -> nops(s[2])>0); end_proc: intersections([{a}, {b}, {a,b,c}]) [[{1, 3}, {a}], [{2, 3}, {b}]] intersections([{a}, {a, b}, {a, b, c}]) [[{1, 2}, {a}], [{1, 3}, {a}], [{2, 3}, {a, b}], [{1, 2, 3}, {a}]] Actually, I'm primarily interested in the maximal combinations of sets, so if in the last example the result was [[{2, 3}, {a, b}], [{1, 2, 3}, {a}]], that might be even better. It's obviously possible to get these results with fewer calculations, since adding more sets to a selection that already has an empty intersection won't lead to new results. Does the combinat library have something helpful for me? Bonus question: What about multisets? I can emulate them with sets, as in {[a, 1], [b, 1], [b, 2]}, but if the code could handle them directly, that would probably be more readable and faster. (In case you are interested: I'm trying to find common factors in a sum, for simplification.) Regards, Christopher (hoping he is actually subscribed to the users' list) |
From: Nicolas M. T. <Nic...@ma...> - 2006-05-14 23:18:41
|
Dear MuPAD-Combinat users and developers, Below is a message from the SourceForge team. The main consequence for us is that the cvs host is now renamed into mupad-combinat.cvs.sf.net instead of cvs.sf.net. Groumph: last time was exactly 2 years ago ... All of us which have installed MuPAD-Combinat by mean of cvs need to check out a new working copy. The brave ones can use instead the following shell command to fix their existing working copy: find . -name Root -exec perl -pi.bak -e 's/cvs.s/mupad-combinat.cvs.s/' '= {}' ';' While we are at checking out new working copies for all our users, we could as well take the occasion to switch to Subversion. Subversion is a replacement for CVS with a very similar user interface, but which much more powerful and actually simpler. In particular it becomes trivial to rename and move around files, a missing feature of CVS that did hurt us very often in the past: subversion.tigris.org We also need to have a clean version of MuPAD-Combinat by the end of May to put in the upcoming MuPAD 4.0.0 distribution, and a stable release before FPSAC. I thus propose the following agenda: - Feature freeze starts *now* - Those who have code or documentation fixes update their cvs working copy, and do their commits before May 21st. - Last tests and release build: May 22-24th - Last commit to MuPAD CVS and official release: May 31st - Beginning of June: possible switch to subversion Comments anyone? Cheers, Nicolas ----- Forwarded message from "SourceForge.net Team" Subject: SUBJECT: SourceForge.net: CVS service offering changes=20 Date: Thu, 11 May 2006 16:23:15 -0700 (PDT) You are receiving this mail because you are a project admin for a SourceForge.net-hosted project. One of our primary services, CVS, suffered a series of interrelated, critical hardware failures in recent weeks. We understand how frustrating this CVS outage must be to you and your users; however, our top priority remains preservation of the integrity of your data. The series of CVS hardware failures prompted us to expedite the deployment of planed improvements to our CVS infrastructure, drawing upon much of the knowledge that we gained from our Subversion deployment. Our improved CVS service architecture, which we plan to deploy tomorrow afternoon (2006-05-12), will offer greater performance and stability and will eliminate several single points of failure. The Site Status page (https://www.sf.net/docs/A04) will be updated as soon as the new infrastructure is rolled out. In the interim, please read the important information provided below to learn about how these changes will affect your project. Summary of changes, effective 2006-05-12: 1. Hostname for CVS service Old: cvs.sourceforge.net New: PROJECT_UNIX_NAME.cvs.sourceforge.net This change will require new working copies to be checked out of all repositories (so control files in the working copy will point to the right place). We will be updating the instructions we supply, but instructions that your team has written within documentation, etc. will need to be updated. cvs -d:pserver:ano...@cv...:/cvsroot/gaim co gaim would be changed to cvs -d:pserver:ano...@ga...:/cvsroot/gaim co gaim 2. ViewCVS We are moving from ViewCVS to its successor, ViewVC. ViewVC is currently in use for our Subversion service. 3. Sync delay Old: CVS pserver, tarballs and ViewCVS provided against a separate server which is a minimum of three hours behind developer CVS. New: ViewVC will be provided against developer CVS (it will be current). CVS pserver will be provided against a secondary server (not developer server) with a maximum expected delay of two hours. Follow-up work is planned (this infrastructure takes us 80% of the way) to essentially eliminate the sync delay. 4. Read-only rsync service As a new service offering, we are now providing read-only rsync access against developer CVS. This allows projects to efficiently make on-demand backups of their entire CVS repository. All projects should be making regular backups of their CVS repository contents using this service. 5. Nightly tarball service Nightly tarball service is being dropped in lieu of read-only rsync service. Projects which currently depend on nightly tarballs for repository backups will need to begin using rsync to make a backup copy of their repository contents. We see this as a major functional improvement. For a number of reasons, tarballs have fallen out of sync with the data in the repository at times in the past few years. Tarballs required a substantial amount of additional disk, and I/O to generate. The move to read-only rsync allows backups to be produced on-demand, with an update frequency chosen by the project. 6. Points of failure In the past, developer CVS service for all projects was provided from a single host. CVS pserver service was provided from individual backend heads based on a split of the data. Under our new design, developer CVS and most of our CVS-related services are provided from one of ten CVS hosts (count subject to increase with growth). Each host is independent, and makes a backup copy of the repository data of another host (which is used to provide the pserver CVS service). Failure of a single host will impact only the availability of data on that host. Since the data is split among a larger number of hosts, the size of data impacted by an individual host outage is substantially smaller, and the time required for us to restore service will be substantially shorter. This rapid architecture change has been made possible specifically using the research we performed for our recent launch of Subversion service. We've applied our best practices, produced a substantial amount of internal documentation, and kept an eye toward maintainability. This effort has allowed us to deploy this new architecture quickly once hardware was received, and will permit us to quickly scale this service horizontally as growth and demand requires.=20 Many other minor improvements have also been made to improve the service offering and make it less trouble-prone. The most important of which are listed above. For a full description of the new service offering, and for information on how to use the services described above, please refer to the site documentation for the CVS service after the service has been launched: https://www.sf.net/docs/E04 Thank you, The SourceForge.net Team=20 =2E ----- End forwarded message ----- --=20 Nicolas M. Thi=E9ry "Isil" <nt...@us...> http://Nicolas.Thiery.name/ |