On Wed, Jun 22, 2011 at 07:57:43AM -0700, Reda CHHAIBI wrote:
> > Would you consider working on it?
> In fact, i was thinking about it...
Excellent! That's what I was reading between the lines :-)
> Before getting all fired up, i will need to see how the 'development
> side' works, and learn more
On Wed, Jun 22, 2011 at 08:24:28AM -0700, Anne Schilling wrote:
> Yes, I think the alcove path model is less complex to implement;
I had started implementing the Littleman path model in MuPAD. See
crystals::littlemanPath at the end of [1].
I don't remember the status, but the code there is probab
Dear sage/sage-combinat fan,
I just got the following e-mail. The dead-line is very short but this looks
interesting. It seems that sage or sage-combinat fits well in the call. What
do you think ?
Florent
- Forwarded message -
Subject: appel d'offre NSF (participation internatio
On 6/22/11 8:44 AM, len...@albany.edu wrote:
Yes, I think the alcove path model is less complex to implement;
Brant Jones implemented it for classical types. As far as I remember
a student of Cristian Lenart was thinking of generalizing this to
affine types at the Sage Days in Toronto last year
On 6/22/11 8:21 AM, Daniel Bump wrote:
While checking tracker tickets, it seems that nobody is working on the
littelmann path model for crystals right now... Still someone wrote
this as "todo" in
http://www.sagemath.org/doc/reference/sage/combinat/crystals/highest_weight_crystals.html
Can you
> While checking tracker tickets, it seems that nobody is working on the
> littelmann path model for crystals right now... Still someone wrote
> this as "todo" in
> http://www.sagemath.org/doc/reference/sage/combinat/crystals/highest_weight_crystals.html
>
> Can you provide me with more informat
On Wed, Jun 22, 2011 at 03:58:26PM +0200, Martin Rubey wrote:
> shouldn't that be is_subset and is_superset?
See the discussion on #10938.
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil"
http://Nicolas.Thiery.name/
--
You received this message because you are subscr
> This is definitely the correct place.
Good!
> Most likely, I wrote it :-)
Ok
> As far as I know, no one has worked on this. On the other hand, this
> should be a fairly short, self contained, and useful project. In fact,
> a perfect project for a newcomer, typically during a Sage Days.
>
> Would
"Nicolas M. Thiery" writes:
> Dear Stefan,
>
> Thanks for your feedback!
>
> On Mon, Jun 20, 2011 at 02:08:18PM -0700, Stefan van Zwam wrote:
>>Sorry to bug you again with this (I already did so a few months back), but
>>I still have qualms with Sage's built-in Set type. For starter
Dear Stefan,
Thanks for your feedback!
On Mon, Jun 20, 2011 at 02:08:18PM -0700, Stefan van Zwam wrote:
>Sorry to bug you again with this (I already did so a few months back), but
>I still have qualms with Sage's built-in Set type. For starters, it does
>not offer the same int
On Mon, Jun 20, 2011 at 03:17:57PM -0700, Reda CHHAIBI wrote:
> Hi, I am quite new to sage and on the irc channel i was advised to ask
> my question here. Was i wrong on whether starting this as a new
> discussion?
This is definitely the correct place.
> While checking tracker tickets, it seems t
Hi all,
Sorry to bug you again with this (I already did so a few months back), but I
still have qualms with Sage's built-in Set type. For starters, it does not
offer the same interface that Python's frozenset offers (example: the
issubset() method).
But my more serious concern is speed. I woul
Hi, I am quite new to sage and on the irc channel i was advised to ask
my question here. Was i wrong on whether starting this as a new
discussion?
While checking tracker tickets, it seems that nobody is working on the
littelmann path model for crystals right now... Still someone wrote
this as "tod
Hi all,
Sorry to bug you again with this (I already did so a few months back), but I
still have qualms with Sage's built-in Set type. For starters, it does not
offer the same interface that Python's frozenset offers (example: the
issubset() method).
But my more serious concern is speed. I woul
14 matches
Mail list logo
