#11410: 01 sequence or east-north sequence for partitions
---------------------------------------+------------------------------------
Reporter: pdehaye | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-5.7
Component: combinatorics | Resolution:
Keywords: partition | Work issues:
Report Upstream: N/A | Reviewers: Frédéric Chapoton,
Nathann Cohen
Authors: Paul-Olivier Dehaye | Merged in:
Dependencies: | Stopgaps:
---------------------------------------+------------------------------------
Comment (by darij):
@name: Richard Stanley (in "The Rank and Minimal Border Strip
Decomposition of a Skew Partition") calls this the "Comét code" of the
partition, probably referring to one of the encodings in Stig Comét's
http://www.ams.org/journals/mcom/1955-09-052/S0025-5718-1955-0074954-0/ .
May I suggest implementing a similar back-and-forth conversion for skew
partitions and biwords of 0's and 1's? Of course, one could take the Comét
code of the inner rim and the outer rim, but then one would have to fumble
around with their offsets to make them match, so an implementation in the
library would be preferred.
Curiosity question: What is a difference between a normal and an
"indirect" doctest?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11410#comment:11>
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.
