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
Implement a method in ClusterSeed for presenting the upper bound algebra #18800
Comments
This comment has been minimized.
This comment has been minimized.
comment:1
Attachment: cluster_seed.py.gz |
This comment has been minimized.
This comment has been minimized.
comment:6
you need to provide a git branch, not an attachment |
Branch: public/ticket/18800 |
Commit: |
comment:9
Thank you for all the work and help. It is much appreciated! The code is a lot cleaner now. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:15
bot is green. That would be a good time for a review. |
comment:16
Computations seem to behave as I expected. Since the bot is green, I think we're good to go. |
Reviewer: Gregg Musiker |
Changed branch from public/ticket/18800 to |
Adds a find_upper_bound method to ClusterSeed. This method implements the algorithm in !arXiv:1307.0579 for giving a presentation of the upper bound algebra in terms of generators and relations.
It inputs a ClusterSeed and outputs the upper bound algebra as a quotient_ring.
CC: @Etn40ff @sagetrac-gmoose05 @egunawan @thecaligarmo
Component: combinatorics
Keywords: cluster, SageDays64.5, upper bound
Author: Jacob P. Matherne, Matthew R. Mills, Greg Muller, Harold Williams
Branch/Commit:
3676fd5
Reviewer: Gregg Musiker
Issue created by migration from https://trac.sagemath.org/ticket/18800
The text was updated successfully, but these errors were encountered: