On 3/28/11 11:21 PM, Martin Rubey wrote:
Good morning gurus!
Two questions: 1)
applying crystals_localCharacterization_td.patch
patching file sage/categories/highest_weight_crystals.py
Hunk #3 FAILED at 125
1 out of 3 hunks FAILED -- saving rejects to file
sage/categories/highest_weight_crysta
Good morning gurus!
Two questions: 1)
applying crystals_localCharacterization_td.patch
patching file sage/categories/highest_weight_crystals.py
Hunk #3 FAILED at 125
1 out of 3 hunks FAILED -- saving rejects to file
sage/categories/highest_weight_crystals.py.rej
patch failed, unable to continue
On 3/28/11 3:21 PM, Daniel Bump wrote:
The patch contains this:
ind = lambda i: (-w0.action(alpha[i])).support()[0]
This would be called for each element of hw, which
depends on the distance to the highest weight vector.
That's not so bad, but if you looped over the crystal and
computed the in
The patch contains this:
ind = lambda i: (-w0.action(alpha[i])).support()[0]
This would be called for each element of hw, which
depends on the distance to the highest weight vector.
That's not so bad, but if you looped over the crystal and
computed the involution for every element, it would be
c
On 3/28/11 6:41 AM, Anne Schilling wrote:
On 3/28/11 6:28 AM, bump wrote:
Yes, it also exists for any Cartan type, but my impression was that then
it is called Lusztig involution. My plan is indeed to eventually implement
the Lusztig involution in CrystalOfTableauxElements. What do you think?
"Nicolas M. Thiery" writes:
> As for posets, I don't know. I would tend to first write a draft of
> the method in Posets, and then decide if the interfaces and
> implementations are similar enough to be shared or not.
Here goes:
# http://www.combinatorics.org/Volume_16/PDF/v16i2r9.pdf
# Figure
On 03/28/2011 11:33 AM, Daniel Bump wrote:
> Someone claimed there is a bug in schensted_insert. See:
>
> http://trac.sagemath.org/sage_trac/ticket/8322
>
> I do not know if they are correct.
Thanks for pointing this out, Dan; I wasn't aware of this ticket. I
don't believe the ticket is correct,
> A lot of methods for tableaux are in the Tableau class which only make
> sense for semistandard tableaux, such as `bump` or `schensted_insertion`.
Someone claimed there is a bug in schensted_insert. See:
http://trac.sagemath.org/sage_trac/ticket/8322
I do not know if they are correct.
Dan
-
> So that's a call for volunteers for reviewing it. Christian, Frédéric,
> are you still up for that? What's your time line?
thanks, Nicolas, for all the work! I gonna look at it as soon as I
find some time, say until the end of next week...
Best, Christian
--
You received this message because
On Mon, Mar 28, 2011 at 05:00:59PM +0200, Viviane Pons wrote:
> Ok, I've followed the instructions and exported the patch. I also
> moved it up into the queue so that it appears with the positive
> reviewed patches.
And back to positive review on trac indeed. Don't worry, the first
submission cycl
Dear Poset fans,
My patch is now under "needs review":
http://trac.sagemath.org/sage_trac/ticket/10998
So that's a call for volunteers for reviewing it. Christian, Frédéric,
are you still up for that? What's your time line?
Cheers,
Nicolas
--
Nicolas M. T
Ok, I've followed the instructions and exported the patch. I also
moved it up into the queue so that it appears with the positive
reviewed patches.
Regards
Viviane
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, s
>> Yes, I know, that's where the smiley came from... I should have asked
>> more plainly: isn't there a class for semistandard tableaux?
>
> A lot of methods for tableaux are in the Tableau class which only make
> sense for semistandard tableaux, such as `bump` or `schensted_insertion`.
For what
On 3/28/11 7:05 AM, Martin Rubey wrote:
Anne Schilling writes:
Hi Martin,
Promotion is defined on semistandard tableaux over the totally ordered alphabet
say {1,2,...,n+1}. Your example below
sage: t = Tableau([[3, 2, 1]])
is not a semistandard tableau since it is decreasing in its row. Bef
Anne Schilling writes:
> Hi Martin,
>
> Promotion is defined on semistandard tableaux over the totally ordered
> alphabet
> say {1,2,...,n+1}. Your example below
>
> sage: t = Tableau([[3, 2, 1]])
>
> is not a semistandard tableau since it is decreasing in its row. Before
> promotion
> was only
On 3/28/11 6:28 AM, bump wrote:
Yes, it also exists for any Cartan type, but my impression was that then
it is called Lusztig involution. My plan is indeed to eventually implement
the Lusztig involution in CrystalOfTableauxElements. What do you think?
That sounds like the right approach. Actual
Hi Martin,
Promotion is defined on semistandard tableaux over the totally ordered alphabet
say {1,2,...,n+1}. Your example below
sage: t = Tableau([[3, 2, 1]])
is not a semistandard tableau since it is decreasing in its row. Before
promotion
was only implemented for rectangle, now it is suppos
> Yes, it also exists for any Cartan type, but my impression was that then
> it is called Lusztig involution. My plan is indeed to eventually implement
> the Lusztig involution in CrystalOfTableauxElements. What do you think?
That sounds like the right approach. Actually the Lusztig involution
wou
I have a somewhat related question about combinatorial species. A
combinatorial species is really a functor from the category of finite
set with bijections to the same category.
Let F be such a species.
Currently (in Sage) we have that
F.structures(someListOfLabels)
gives an iterator over the
Hello !
>> I'm rewriting subword, subset, set_partition_ordered and set_partition
>> in order to
>> * correct many bugs (as example sage: Subwords([1,2,3], 0).last())
>> * improve documentation (in many case write the documentation)
>> * have admissibe time (eg not infinite) for iterations
On Sat, Mar 26, 2011 at 03:28:49AM -0700, Simon King wrote:
> I guess that F.basis() should have some index set. Here, it seems
> natural to me to choose M=FreeMonoid(3,['x','y','z']): If m is in M
> then F.basis()[m] returns the corresponding element of F.
>
> Is that the only requirement to F.ba
Hi Simon!
On Sun, Mar 27, 2011 at 10:50:50PM -0700, Simon King wrote:
> On 28 Mrz., 07:42, Simon King wrote:
> > On 27 Mrz., 23:12, "Nicolas M. Thiery"
> > wrote:
> >
> > > - The ticket contains two fairly distinct sets of features:
> > > - (1) The categorification of quotient rings
On Sun, Mar 27, 2011 at 10:42:07PM -0700, Simon King wrote:
> On 27 Mrz., 23:12, "Nicolas M. Thiery"
> wrote:
> > - The ticket contains two fairly distinct sets of features:
> > - (1) The categorification of quotient rings and the like
> > - (2) The letterplace free algebra
> > What ab
On Sun, Mar 27, 2011 at 11:07:58PM -0700, Anne Schilling wrote:
> On 3/27/11 6:27 PM, bump wrote:
> >>I just added a new patch on trac which implements the Schuetzenberger
> >>involution on both words and tableaux and also the promotion operator
> >>on tableaux of arbitrary shape:
> >>
> >>http://t
24 matches
Mail list logo
