#19541: Implement Hecke insertion
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.10
Component: combinatorics | Resolution:
Keywords: hecke insertion, | Merged in:
RSK | Reviewers:
Authors: Travis Scrimshaw | Work issues:
Report Upstream: N/A | Commit:
Branch: | f8b10348b37fd6fc755d3eb5ed1b01795c6e74ee
public/combinat/hecke_insertion-19541| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by tscrim):
The comment
{{{
# We must have len(p[j-1]) > len(r), otherwise we would
# have added x to the previous row
}}}
comes from if `len(p[j-1]) == len(r)` (recall `r = p[j]`) and we wanted to
add the entry `x` to the end of `r`, then by the strictly increasing
condition, we should have added `x` to the end of `p[j-1]`. It means that
we can skip the check that `len(p[j-1]) > len(r)`.
--
Ticket URL: <http://trac.sagemath.org/ticket/19541#comment:3>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
