-
-
Notifications
You must be signed in to change notification settings - Fork 631
Add Curiel–Genitrini unranking algorithm #40318
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
base: develop
Are you sure you want to change the base?
Conversation
…sequential_form, sequential_to_canonical_form
…sion wasn't update)
Documentation preview for this PR (built with commit 02a47cc; changes) is ready! 🎉 |
Why do you introduce |
This function was part of the project. Since it has potential future use, I decided to keep it rather than remove it. |
Did you intend to close the pull request ? If not, you can re-open. |
Thanks for the help. I'll do this |
Co-authored-by: Martin Rubey <[email protected]>
Commits:
-Add the function "compare_subsets"
-Add the function "compare_set_partitions"
-Add Curiel-Genitrini unranking algorithm
This PR introduces the unranking algorithm for lexicographic order.