-
-
Notifications
You must be signed in to change notification settings - Fork 572
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
Symmetric group conjugacy class iterator #16018
Comments
Commit: |
comment:3
I iterate over partitions (1,2, ... l1) (l1+1, ... l1+l2) ... (l1+...+lk-1, .. n) where
Without my branch:
So we get about 14x-20x speedup in the representative function, but surprisingly, minimal gain in listing all conjugacy classes. Anyways, I think this is an improvement. I've also added a specific iterator method for the conjugacy classes. New commits:
|
Changed author from Vincent Delecroix to Travis Scrimshaw |
comment:4
Hi Travis, The title of the ticket was perhaps not clear enough, I wanted to iterate through the elements of a given conjugacy class... Let us assume that the purpose changed ;-) Vincent |
comment:5
Ah, so the description should have been something like: Using the underlying GAP commands it takes forever to iterate over a conjugacy class of the Symmetric group. In this ticket we implement a very simple and very naive one that does the job. I'd definitely like to speed that up as well. Do you have that code to iterate over a particular conjugacy class? I'm happy to add that onto here and review it. A question, do you think should we add similar methods to |
comment:6
Replying to @tscrim:
I do. Let me add it to the branch.
I don't know. Most of the time I found that playing with classes makes life harder and I mostly program using tuple and/or lists (this is what my iterator is). One way to make it would be:
What do you think? Vincent |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:9
Replying to @videlec:
Thanks.
Well, I went ahead and played with classes. I implemented a class specifically for conjugacy classes of the symmetric group (in part for the future with implementing a direct computation of character tables directly in Sage, in part to override the behavior of I'm leaning towards just leaving it until we consider |
comment:11
Looks good to me. I tested it out for some examples and it seemed to work correctly. There seemed to be one small issue in the documentation for index_set() which I corrected. New commits:
|
Changed author from Travis Scrimshaw to Travis Scrimshaw, Vincent Delecroix |
Reviewer: Amritanshu Prasad |
comment:12
Thanks Amri. You're change is good with me. |
comment:13
Doctests fail:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:16
Trivial fixes. |
Changed branch from public/groups/conjugacy_classes_symmetric_group-16018 to |
Using the underlying GAP commands it takes forever to iterate over conjugacy classes of the Symmetric group. In this ticket we implement a very simple and very naive one that does the job.
CC: @amritanshu-prasad
Component: combinatorics
Keywords: symmetric group, permutations, iterator
Author: Travis Scrimshaw, Vincent Delecroix
Branch/Commit:
9f7e86a
Reviewer: Amritanshu Prasad
Issue created by migration from https://trac.sagemath.org/ticket/16018
The text was updated successfully, but these errors were encountered: