[sage-combinat-devel] Computing the action of S_n over standard Tableaux
Hi all, Is there currently a way in Sage-combinat to compute the action of a permutation over standard tableaux ? For example, I would like something like : Permutation([2,1,3,4]) * B([[1,2],[3,4]]) = B([[1,2],[3,4]]) - B([[1,3],[2,4]]) This thing is called in French algorithme de redressement (In the same time, what is the equivalent in English ?) and is related to Ganir identity (Or Garnir rules...). They are a lot of thing in combinat but I didn't find it... Can someone confirm that or give my a pointer otherwise... Cheers, Nicolas B. -- 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/groups/opt_out.
Re: [sage-combinat-devel] Computing the action of S_n over standard Tableaux
Second answers on myself, Does the catgeory guys already think the possibility or utility to define the category of : Representations( ring ) Whose Parents belonging to this catgeory would be a king of meet (think meet in terms of category construction) between : A set with an action A modules with basis over the ring whose keys form the set with the defined action Perhaps that is not very relevant or we do not have currently enough use-cases to design that... Cheers, Nicolas B. -- 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/groups/opt_out.
Re: [sage-combinat-devel] Computing the action of S_n over standard Tableaux
Hi, I'm highly in favor of adding more meat to the representations of the Specht modules in Sage. Currently, the way I understand them, they're but a container for matrices. There is a Modules(R) in Sage, but it seems to be tailored for commutative rings. Can we use it for noncommutative R? Best regards, Darij On Mon, Feb 17, 2014 at 12:30 PM, Nicolas Borie nicolas.bo...@univ-mlv.fr wrote: Second answers on myself, Does the catgeory guys already think the possibility or utility to define the category of : Representations( ring ) Whose Parents belonging to this catgeory would be a king of meet (think meet in terms of category construction) between : A set with an action A modules with basis over the ring whose keys form the set with the defined action Perhaps that is not very relevant or we do not have currently enough use-cases to design that... Cheers, Nicolas B. -- 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/groups/opt_out. -- 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/groups/opt_out.
Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras
Nicolas, It is #15305 which is merged. However the morphism-tensoring code seems to be embedded in some code for coercions, rather than abstracted into its own method and used in the coercion. I even saw in the log that you requested this. Travis, am I interpreting things correctly? --Mark Luckily it's been implemented in a recent ticket, though I don't remember which one nor its status. 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/groups/opt_out. -- 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/groups/opt_out.
Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras
Hey Mark, I would say so. Although at that time I was focused just on piecing together the coercions, it probably should be abstracted so we can do something like: sage: tensor([phi, psi, xi]) given some module morphisms phi, psi, and xi to get a morphism of the appropriate tensor products. Is this suppose to be a part of #1? I won't be doing finite tensor products in #15726 if that's what you're thinking of Nicolas. Best, Travis On Monday, February 17, 2014 11:09:25 AM UTC-8, Mark Shimozono wrote: Nicolas, It is #15305 which is merged. However the morphism-tensoring code seems to be embedded in some code for coercions, rather than abstracted into its own method and used in the coercion. I even saw in the log that you requested this. Travis, am I interpreting things correctly? --Mark Luckily it's been implemented in a recent ticket, though I don't remember which one nor its status. Cheers, Nicolas -- Nicolas M. Thiéry Isil nth...@users.sf.net javascript: 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 javascript:. To post to this group, send email to sage-comb...@googlegroups.comjavascript:. Visit this group at http://groups.google.com/group/sage-combinat-devel. For more options, visit https://groups.google.com/groups/opt_out. -- 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/groups/opt_out.
Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras
Travis and Nicolas, Unless someone objects, I am going to make a microticket that adds tensors of maps between free modules with basis and fixes the type-checking in the element constructor. --Mark Hey Mark, I would say so. Although at that time I was focused just on piecing together the coercions, it probably should be abstracted so we can do something like: sage: tensor([phi, psi, xi]) given some module morphisms phi, psi, and xi to get a morphism of the appropriate tensor products. Is this suppose to be a part of #1? I won't be doing finite tensor products in #15726 if that's what you're thinking of Nicolas. Best, Travis On Monday, February 17, 2014 11:09:25 AM UTC-8, Mark Shimozono wrote: Nicolas, It is #15305 which is merged. However the morphism-tensoring code seems to be embedded in some code for coercions, rather than abstracted into its own method and used in the coercion. I even saw in the log that you requested this. Travis, am I interpreting things correctly? --Mark Luckily it's been implemented in a recent ticket, though I don't remember which one nor its status. Cheers, Nicolas -- Nicolas M. Thiéry Isil nth...@users.sf.net javascript: 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 javascript:. To post to this group, send email to sage-comb...@googlegroups.comjavascript:. Visit this group at http://groups.google.com/group/sage-combinat-devel. For more options, visit https://groups.google.com/groups/opt_out. -- 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/groups/opt_out. -- 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/groups/opt_out.
Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras
Nicolas, I am not entirely happy with the way covariant construction functors are applied. I think the Cartesian and tensor product constructors should always receive tuples of parents/elements/maps and the constructor for QQ-algebra should accept a single parent/element/map. It would be a good idea to be able to optionally specify the category if it is getting annoying to guess the category. It seems very hacky to look for a method with a certain name, to tell whether the constructor applies (which is what the code does right now). What is the list of such construction functors in sage? --Mark -- 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/groups/opt_out.
Re: [sage-combinat-devel] tensor products of free modules; combinatorial algebras
On Mon, Feb 17, 2014 at 07:36:10PM -0500, Mark Shimozono wrote: Unless someone objects, I am going to make a microticket that adds tensors of maps between free modules with basis and fixes the type-checking in the element constructor. Please! More on the rest after my class ... 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/groups/opt_out.
[sage-combinat-devel] Re: Computing the action of S_n over standard Tableaux
Are you looking for something like this: sage: StandardTableau([[1,2,4],[3,5]]).symmetric_group_action_on_entries( Permutation(((4,5))) ) [[1, 2, 5], [3, 4]] If you also wants straightening then I guess it is implicit in the action of implementation of seminormal forms. Andrew On Tuesday, 18 February 2014 03:52:46 UTC+11, Nicolas Borie wrote: Hi all, Is there currently a way in Sage-combinat to compute the action of a permutation over standard tableaux ? For example, I would like something like : Permutation([2,1,3,4]) * B([[1,2],[3,4]]) = B([[1,2],[3,4]]) - B([[1,3],[2,4]]) This thing is called in French algorithme de redressement (In the same time, what is the equivalent in English ?) and is related to Ganir identity (Or Garnir rules...). They are a lot of thing in combinat but I didn't find it... Can someone confirm that or give my a pointer otherwise... Cheers, Nicolas B. -- 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/groups/opt_out.
Re: [sage-combinat-devel] Computing the action of S_n over standard Tableaux
I'm highly in favor of adding more meat to the representations of the Specht modules in Sage. Currently, the way I understand them, they're but a container for matrices. At some point I will release my graded Specht module code (arbitrary level) which is IMHO is state of the art for representations of symmetric groups in positive characteristic. I'm not ready to do this yet...and I haven't had time to play with this for a long time... Andrew -- 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/groups/opt_out.
[sage-combinat-devel] Re: list papers citing sage!
I couldn't see how to edit the page. Sorry! I wanted to add the following preprint/book chapter (book chapters don't seem to exist in the list yet): Andrew Mathas, a href=http://front.math.ucdavis.edu/1310.2142;Cyclotomic quiver Hecke algebras of type A/A, *arXiv:1310.2142* *Andrew* On Monday, 17 February 2014 04:07:33 UTC+11, Anne Schilling wrote: Dear All! It's the time of the year when we need to report to our funding agencies. Please, if you have written papers that used sage or sage-combinat, post them at http://www.sagemath.org/library-publications-combinat.html (or respond to this e-mail to get them posted)! Thank you, 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/groups/opt_out.
Re: [sage-devel] Re: Issue With Implementation of Gamma Function
a last update: MPFR now uses the Von Staudt=E2=80=93Clausen theorem to comp= ute Bernoulli numbers (thanks to Fredrik Johansson for pointing out this formul= a). On my computer, computing gamma(Pi^2) to 1 bits takes about 1.4s (for t= he first computation, when Bernoulli numbers are not cached) instead of 6.1s w= ith Pari/GP. Paul Zimmermann --=20 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 e= mail 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. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Re: Issue With Implementation of Gamma Function
On Mon, 17 Feb 2014, Zimmermann Paul wrote: On my computer, computing gamma(Pi^2) to 1 bits takes about 1.4s (for the first computation, when Bernoulli numbers are not cached) instead of 6.1s with Pari/GP. Out of curiosity: How this compares to, for example, Mathematica? -- Jori Mäntysalo -- 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. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Re: Issue With Implementation of Gamma Function
Hi Jori, Date: Mon, 17 Feb 2014 14:56:56 +0200 (EET) From: Jori Mantysalo jori.mantys...@uta.fi =20 On Mon, 17 Feb 2014, Zimmermann Paul wrote: =20 On my computer, computing gamma(Pi^2) to 1 bits takes about 1.4s (f= or the first computation, when Bernoulli numbers are not cached) instead of 6.= 1s with Pari/GP. =20 Out of curiosity: How this compares to, for example, Mathematica? =20 --=20 Jori M=C3=A4ntysalo I don't have access to Mathematica, but according to [1], Mathematica 8.0 t= akes about 1.7 seconds for the first computation at 3000 decimal digits, which i= s comparable to 1 bits (however this is for complex input, I don't know i= f Mathematica is faster for real numbers). Subsequent computations on my machine take 0.083s each with the development version of MPFR (at 1 bits). Paul [1] http://fredrikj.net/blog/2013/02/timings-for-the-complex-gamma-function= -in-arb/ --=20 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 e= mail 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. For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] Re: systemd and trac #381
Henry de Valence hdevale...@hdevalence.ca writes: Hi all, while looking at the SAGE FAQ here [1], I noticed the link to Trac #381 [2] (the link is broken, on the FAQ page, though). One option which is not mentioned, but which is extremely convenient, is to run Sage using a systemd user session. The Arch Linux packages for Sage include the file /usr/lib/systemd/user/sage.service [snip] This approach requires systemd and is Linux-specific, but as every major Linux distribution is either using systemd now or plans to move to it in the future, it seems like it might be worthwhile for Sage to ship systemd .service files for Linux users. +1, this sounds like a good idea! I made #15828 to track this, though I don't (yet) use systemd so I won't involve myself in actually doing the work ;) http://trac.sagemath.org/ticket/15828 Thanks, Keshav -- 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. For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] Re: systemd and trac #381
On 2/15/14 11:44 PM, Henry de Valence wrote: This approach requires systemd and is Linux-specific, but as every major Linux distribution is either using systemd now or plans to move to it in the future, it seems like it might be worthwhile for Sage to ship systemd .service files for Linux users. Well, except for Ubuntu. But nevertheless, thanks! (as a person moving to a systemd-based system) Thanks, Jason -- 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. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Re: systemd and trac #381
On Mon, Feb 17, 2014 at 9:07 AM, Jason Grout jason-s...@creativetrax.com wrote: On 2/15/14 11:44 PM, Henry de Valence wrote: This approach requires systemd and is Linux-specific, but as every major Linux distribution is either using systemd now or plans to move to it in the future, it seems like it might be worthwhile for Sage to ship systemd .service files for Linux users. Well, except for Ubuntu. But nevertheless, thanks! (as a person moving to a systemd-based system) Ubuntu is moving to systemd soon. http://www.linux.com/news/software/applications/762189-shuttleworth-losing-gracefully Thanks, Jason -- 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. 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. For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] Re: systemd and trac #381
On 2/17/14 11:09 AM, William Stein wrote: On Mon, Feb 17, 2014 at 9:07 AM, Jason Grout jason-s...@creativetrax.com wrote: On 2/15/14 11:44 PM, Henry de Valence wrote: This approach requires systemd and is Linux-specific, but as every major Linux distribution is either using systemd now or plans to move to it in the future, it seems like it might be worthwhile for Sage to ship systemd .service files for Linux users. Well, except for Ubuntu. But nevertheless, thanks! (as a person moving to a systemd-based system) Ubuntu is moving to systemd soon. http://www.linux.com/news/software/applications/762189-shuttleworth-losing-gracefully Oh, wow, I guess that seals the fate of upstart. Thanks for pointing this out. Jason -- 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. For more options, visit https://groups.google.com/groups/opt_out.
[sage-devel] Re: systemd and trac #381
I had some troubles running the buildbot slave through systemd. You service will be selinux confined and some doctests with external programs fail on Fedora 20. Nothing particularly important afair. -- 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. For more options, visit https://groups.google.com/groups/opt_out.
Re: [sage-devel] Re: Ticket 15003
Hello, A review on the ticket would be great http://trac.sagemath.org/ticket/15003. Thanks. On Sat, Feb 15, 2014 at 7:14 AM, Amit Jamadagni bitsjamada...@gmail.comwrote: Hello, I have tried to resolve the issue. Any comments would be helpful. Thanks. On Fri, Feb 14, 2014 at 4:31 AM, Volker Braun vbraun.n...@gmail.comwrote: Never copypaste code around. Just call gamma from factorial. On Thursday, February 13, 2014 8:13:47 PM UTC, Amit Jamadagni wrote: Hello, I was going through this ticket http://trac.sagemath. org/ticket/15003. The factorial should return gamma(x+1) which is the necessary answer, can this be directly called or should there be a replication of the code from gamma implementation.I was going through real_mpfi.pyx. This is the first time I am trying to fix a ticket for Sage. Any help would be really great. Thanks. -- 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. For more options, visit https://groups.google.com/groups/opt_out. -- 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. For more options, visit https://groups.google.com/groups/opt_out.
