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
Use permutation implementation of Weyl groups to compute LS path energy #22994
Comments
This comment has been minimized.
This comment has been minimized.
Commit: |
comment:1
With branch:
Before:
(Be warned, you might also have the GAP startup time in the initial computation.) New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:3
I found some more speed by iterating over the weight orbit rather than building the full list:
vs old:
|
Reviewer: Ben Salisbury |
comment:4
All documentation builds (both PDF and HTML) on my machine, but here is the output of
|
comment:6
facepalm I need to actually call the iterator function. I also used it in two other places where I could. |
comment:7
Everything looks good now (at least on my machine). |
comment:8
"it as 6 elements" ? |
Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. New commits:
|
comment:10
Didn't even notice it because I wasn't really reading it. Fixed, and I'm allowing myself to reset to positive review because it is a trivial change. |
Changed branch from public/crystals/faster_ls_path_energy-22994 to |
Basically all of the time is spent creating the parabolic quantum Bruhat graph.
This is an implementation detail, so let's use the fastest version of the Weyl group to compute the parabolic quantum Bruhat graph.
CC: @sagetrac-sage-combinat @anneschilling @bsalisbury1
Component: combinatorics
Keywords: crystals, energy function
Author: Travis Scrimshaw
Branch/Commit:
8ae3722
Reviewer: Ben Salisbury
Issue created by migration from https://trac.sagemath.org/ticket/22994
The text was updated successfully, but these errors were encountered: