New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Regular partitions: 1-regular partitions are mishandled on occasion #20584
Comments
Commit: |
comment:1
Hey, I finally remembered to fix this. New commits:
|
Author: Travis Scrimshaw |
comment:4
Fixed a couple little things, one of which predated this ticket. I don't know if there is an established way of guaranteeing that any function/method that takes a regular partition will still work with a 1-regular partition. Barring that, the only criterion are the doctests, right? Everything else LGTM. |
comment:5
Replying to @darijgr:
Thanks.
No, I don't think there is such a way other than those functions/methods having explicit checks. This is a degenerate case in terms of my applications (there is not really an [affine] sl1), so I'm not really worried. |
Reviewer: Travis Scrimshaw |
Changed reviewer from Travis Scrimshaw to Darij Grinberg |
Changed branch from public/combinat/fix_1_regular_partitions-20584 to |
1-regular partitions exist (although there is just one of them -- the empty one). Not all of the code behaves well at \ell=1, though; e.g., the iterator runs infinite loops once it's past [].
CC: @tscrim
Component: combinatorics
Keywords: partition, regular partition, border case
Author: Travis Scrimshaw
Branch/Commit:
7ba506c
Reviewer: Darij Grinberg
Issue created by migration from https://trac.sagemath.org/ticket/20584
The text was updated successfully, but these errors were encountered: