Opened 9 years ago

Last modified 8 years ago

## #11410 closed enhancement

# 01 sequence or east-north sequence for partitions — at Initial Version

Reported by: | pdehaye | Owned by: | sage-combinat |
---|---|---|---|

Priority: | minor | Milestone: | sage-5.8 |

Component: | combinatorics | Keywords: | partition |

Cc: | sage-combinat | Merged in: | |

Authors: | Reviewers: | ||

Report Upstream: | N/A | Work issues: | |

Branch: | Commit: | ||

Dependencies: | Stopgaps: |

### Description

add a method to the partition class that would return the 01 sequence of the partition (the sequence of north or east steps taken along the boundary of the partition). since this is really an biinfinite sequence starting with 0000000 and ending with 11111111, this should return a a finite list of 0s and 1s, starting for any (non-empty) partition with a 1 and ending with a 0.

**Note:**See TracTickets for help on using tickets.