#14456: New methods for alternating sign matrices
-----------------------------------+----------------------------------------
Reporter: jessicapalencia | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.10
Component: combinatorics | Resolution:
Keywords: asm | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: #14301 | Stopgaps:
-----------------------------------+----------------------------------------
Comment (by tscrim):
Also as a heads-up. Gelfand-Tsetlin patterns are now sequences of
partitions (i.e. the rows are reversed to how they were before), and
subsequently the same holds true for monotone triangles.
Jessica, you might want to take a look at #14301 and make sure the
bijection is still agrees with what you expect on a more complicated
example and probably add that as a doctest (either here or there). I can
still go bijectively between ASM's and monotone triangles, and I didn't
have to change any doctests (as I alluded to before, they are symmetric
permutation matrices which I don't think are the best examples).
Best,[[BR]]
Travis
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14456#comment:7>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
