[sage-combinat-devel] Re: Sage grant
Regarding this request, William has a question which interactive visualization objects would be most useful for people with combinatorial inclination. Certainly graphs, trees, but I guess also 3- or multi-dimensional objects such as plane partitions and polytopes ... Anything else? Best, Anne On 10/28/14 4:42 PM, Anne Schilling wrote: Dear All! Dan Bump, Ben Salisbury, Mark Shimozono and I are planning to apply for an NSF grant for Sage (to fund Sage Days and other Sage related activities). We will mostly focus on topics in combinatorics/algebra/ representation theory. It would be great to hear from you what your wishlists are in this area. What are features you would like to implement/ see implemented? Particular areas we would like to emphasis are representation theory of semigroups, representations of affine Lie algebras and hyperbolic Kac-Moody Lie algebras, KLR algebras, the power of the category code and functorial constructions to implement the DAHA and more. But we are open to other suggestions. Best, Anne -- 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. For more options, visit https://groups.google.com/d/optout.
[sage-combinat-devel] Re: Sage grant
Yo ! Does Math directorate pay for programmers to write open-source versions of commercial software? flame Of course not. It is just that when commercial softwares fail to do the job, we have to do it in their stead. And we cannot seriously expect them to implement what we need for our research, very often that code is only interesting/useful to researchers. /flame Or are these topics designating novel algorithms and data structures? Well. For instance you will find this feature quite useless to non-researchers: sage: print designs.orthogonal_arrays.explain_construction(10,814) Construction 3.4 with n=17,m=47,r=6,s=9 from: Julian R. Abel, Nicholas Cavenagh Concerning eight mutually orthogonal latin squares, Vol. 15, n.3, pp. 255-261, Journal of Combinatorial Designs, 2007 sage: print designs.orthogonal_arrays.explain_construction(22,792) Lemma 4.1 with n=25,m=28 from: Charles J.Colbourn, Jeffrey H. Dinitz, Mieczyslaw Wojtas, Thwarts in transversal designs, Designs, Codes and Cryptography 5, no. 3 (1995): 189-197. It tells you in which paper was proved the existence of an orthogonal array OA(10,814) and OA(22,792). If not for Sage, it is just impossible to find out this kind of information (*). That's not really computer science, that's more archeology than mathematics, but it can be useful to (some) mathematicians. Nathann (*) It is not just a database. We implement different recursive constructions from different papers, Sage computes all possible combinations of them and find out which leads to the result. I dare you to do it with a paper and pen :-P -- 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. For more options, visit https://groups.google.com/d/optout.
Re: [sage-combinat-devel] Re: Sage grant
On Wed, Oct 29, 2014 at 07:09:53PM -0700, Andrew wrote: I agree with Dima in that it would be great to have some of the basic ring theory available in improved. There are some basic deficiencies with (Laurent) polynomial rings, especially in more than one variable and it would great if all of the problems with quite basic rings could be ironed out. In addition, my life would be much easier if sage were able to efficiently compute in the location of a ring at a ideal -- what I would really like is to be able to calculate in modular systems with parameters, which is my way of saying that I would like to be able to explicit calculations in modular systems for Iwahori-Hecke algebras. Implementing all of these gadgets is, perhaps, not so exciting from the point of view of a grant application, but not having these basic ring constructions available limits what you can currently do with sage. +1. The big question here is whether we have someone with both the expertise and time to implement those features, and whether the grant could help provide us such a person ... Cheers, Nicolas -- Nicolas M. Thiéry Isil nthi...@users.sf.net http://Nicolas.Thiery.name/ -- 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. For more options, visit https://groups.google.com/d/optout.
[sage-combinat-devel] Re: Sage grant
Math presumably not Computer Science. Does Math directorate pay for programmers to write open-source versions of commercial software? It is under the NSF-OCI soliciation which is software in any area (biology, astronomy, physics, chemistry, math, ...). We were not planning to ask for a programmer though. Just support for graduate students and Sage Days and such. Or are these topics designating novel algorithms and data structures? They will be useful to explore further mathematical structures. Best, Anne -- 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. For more options, visit https://groups.google.com/d/optout.
[sage-combinat-devel] Re: Sage grant
On 2014-10-28, Anne Schilling a...@math.ucdavis.edu wrote: Dear All! Dan Bump, Ben Salisbury, Mark Shimozono and I are planning to apply for an NSF grant for Sage (to fund Sage Days and other Sage related activities). We will mostly focus on topics in combinatorics/algebra/ representation theory. It would be great to hear from you what your wishlists are in this area. What are features you would like to implement/ see implemented? Particular areas we would like to emphasis are representation theory of semigroups, representations of affine Lie algebras and hyperbolic Kac-Moody Lie algebras, KLR algebras, the power of the category code and functorial constructions to implement the DAHA and more. But we are open to other suggestions. how about more pedestrian things like representation theory of semisimple algebras (I mostly need these over QQ, or number fields). some of functionality (implemented in Magma, IMHO) is described here: http://www.sciencedirect.com/science/article/pii/S0021869312000300 in particular this needs dealing with (non-commutative) maximal orders, somthing that can be found in Magma... Dima Best, Anne -- 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. For more options, visit https://groups.google.com/d/optout.
[sage-combinat-devel] Re: Sage grant
Hi Anne, I agree with Dima in that it would be great to have some of the basic ring theory available in improved. There are some basic deficiencies with (Laurent) polynomial rings, especially in more than one variable and it would great if all of the problems with quite basic rings could be ironed out. In addition, my life would be much easier if sage were able to efficiently compute in the location of a ring at a ideal -- what I would really like is to be able to calculate in modular systems with parameters, which is my way of saying that I would like to be able to explicit calculations in modular systems for Iwahori-Hecke algebras. Implementing all of these gadgets is, perhaps, not so exciting from the point of view of a grant application, but not having these basic ring constructions available limits what you can currently do with sage. So far I have always found way to get around these problems, but it has been much harder than I expected. Regarding you suggested wish-list, I have already implemented graded Specht modules for KLR algebras for quivers of type A and when I have time I can get the finite dimensional standards as well. My work on this has stalled, but I am hoping to be able to restart soon, so perhaps we should talk more about this aspect of what you are planning. Andrew On Wednesday, 29 October 2014 10:42:53 UTC+11, Anne Schilling wrote: Dear All! Dan Bump, Ben Salisbury, Mark Shimozono and I are planning to apply for an NSF grant for Sage (to fund Sage Days and other Sage related activities). We will mostly focus on topics in combinatorics/algebra/ representation theory. It would be great to hear from you what your wishlists are in this area. What are features you would like to implement/ see implemented? Particular areas we would like to emphasis are representation theory of semigroups, representations of affine Lie algebras and hyperbolic Kac-Moody Lie algebras, KLR algebras, the power of the category code and functorial constructions to implement the DAHA and more. But we are open to other suggestions. Best, Anne -- 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. For more options, visit https://groups.google.com/d/optout.
