On Sat, Mar 6, 2010 at 9:26 PM, bump wrote:
>
> On Mar 6, 3:52 pm, Pedro Sanchez wrote:
>
> > > consider also the code in
> There should actually be two versions of this. This version (as Anne
> said)
> relates nxn matrices with nonnegative integer values to pairs of
> tableaux with
> the same s
On Mar 6, 3:52 pm, Pedro Sanchez wrote:
> > consider also the code in
> > sage: Permutation([6,2,3,1,7,5,4]).robinson_schensted()
> > which performs insertions (and more). Mike Hansen added it, it bisects
> > per row, and is thus be much faster for large partitions.
>
> > in any case there shoul
On Sat, Mar 6, 2010 at 6:35 PM, Anne Schilling wrote:
>
>> There's a generalization by Knuth (check "Robinson-Schensted-Knuth
>> algorithm" ) that uses insertion for non-permutations and bijectively maps
>>
>> arbitrary matrices <--> two-row arrays <--> pairs of semistandard
>> tableau
>>
>
> I
consider also the code in
sage: Permutation([6,2,3,1,7,5,4]).robinson_schensted()
which performs insertions (and more). Mike Hansen added it, it bisects
per row, and is thus be much faster for large partitions.
in any case there should really be a function called T.bump()!
On Sat, Mar 6, 2010 at 5:32 PM, Paul-Olivier Dehaye
wrote:
> consider also the code in
> sage: Permutation([6,2,3,1,7,5,4]).robinson_schensted()
> which performs insertions (and more). Mike Hansen added it, it bisects
> per row, and is thus be much faster for large partitions.
>
> in any case ther
Hi Florent,
Is this related to k-shapes that we discussed a couple of years
ago at a conference in Montreal?
Yes ! How did you guess ?
Constructing skew partitions from their row and column lengths
just sounded like the things that were discussed there :-) !
The problem with allowing zero
consider also the code in
sage: Permutation([6,2,3,1,7,5,4]).robinson_schensted()
which performs insertions (and more). Mike Hansen added it, it bisects
per row, and is thus be much faster for large partitions.
in any case there should really be a function called T.bump()!
paul
On Sat, Mar 6, 2
Hi
> the patch 8429 depends on many patches merged in 4.3.4.alpha1 already
> (for instance 8418). Did you applied those first?
>
> Maybe I should not guard by 4_3_4 the patches which 8429 depends on
I changed the guards... I'll put them back as soon ad alpha1 is out.
Cheers,
--
You re
On Sat, Mar 6, 2010 at 11:08 AM, bump wrote:
> Tableau method contains two methods, bump and schensted_insert.
>
> I think these are equivalent. That is, I was unable to find case where
> T.bump(i) and T.schensted_insert(i) produced different output.
>
> Am I missing something?
>
> Dan
>
> --
> Y
A free module like this one:
#
class AA(CombinatorialFreeModule):
def __init__(self,KK):
CombinatorialFreeModule.__init__(self, KK, [1,2,3],
prefix = 'A',
Hi Florent,
the patch 8429 depends on many patches merged in 4.3.4.alpha1 already
(for instance 8418). Did you applied those first?
Maybe I should not guard by 4_3_4 the patches which 8429 depends on
Sébastien
2010/3/6 Florent Hivert :
> Dear Sébastien,
>
> For some reason, the patch t
Dear Sébastien,
For some reason, the patch trac_8429_split_word-sl.patch is rejected against
4.3.4alpha0... I guarded it. You probably want to update it.
Cheers,
Florent
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to
Hi Anne,
> Is this related to k-shapes that we discussed a couple of years
> ago at a conference in Montreal?
Yes ! How did you guess ?
>> The problem with allowing zeroes is that there may be several correct
>> answers:
>> for example with row=[0,0] and col=[0,0] the skew partitions:
>>
Tableau method contains two methods, bump and schensted_insert.
I think these are equivalent. That is, I was unable to find case where
T.bump(i) and T.schensted_insert(i) produced different output.
Am I missing something?
Dan
--
You received this message because you are subscribed to the Googl
Hi Florent,
Is this related to k-shapes that we discussed a couple of years
ago at a conference in Montreal?
If you forbid zeros, then you would also exclude cases like
sage: mu=SkewPartition([[2,1],[1,1]])
sage: mu.column_lengths()
[0, 1]
since the first column length is zero, right? Is that de
Hi there,
I recently revamped a code from MuPAD-Combinat whose goal is to compute a skew
partition from its row and column length. As Nicolas the little pointed out
during the review, there are some corner cases which is problematic:
sage: S = SkewPartition(([6],[6]))
sage: S.column_length
16 matches
Mail list logo
