-
-
Notifications
You must be signed in to change notification settings - Fork 553
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
Challenge: iterating through E8 in 5 minutes #9285
Comments
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
comment:3
Instead of taking the nomenclature ["E",8], if we take Cartan matrix of E8 manually |
comment:4
On my Asus with i7 quad-core (hyperthreaded to 8) and 8GB RAM and #19821 (and doing other things), I get the following running serially (on 1 thread):
Since E8 is 240 times larger than E7, I expect it to take roughly 240 times longer (although from E6 to E7, it only took 31x longer whereas there is a 56x size difference). That is roughly 23 hours... (in reality, it is probably a lot less, but still on the order of hours). |
This comment has been minimized.
This comment has been minimized.
comment:5
With the recent changes to #19821, I now get:
|
comment:6
With #11187, on my laptop (see comment:4) I get
There are a number of changes from #11187 (the cythonization) that could be lifted up to be used for the general Coxeter group iteration. |
comment:7
With Gap3 in Sage, it took 6m20s to go through E8 on my laptop (serially, comment:4):
|
The current code for iterating trough all elements of a Coxeter group
is currently ridiculously slow. For E8, it should take no more than a
couple minutes as Franck Lubeck's reported was possible in GAP. The
goal is not to brag, but to make sure that the infrastructure does not
impose unnecessary overhead.
There are several routes to this end, which all deserve to be explored:
select
issue in GAP's interface (TODO: add ticket), if not using libGAP,
and implementing the iter protocol for gap objects using GAP's
Iterator (TODO: add ticket).
Update (09/2014): for finite groups of size>1000, Sage's iterator
for matrix groups now asks GAP to make the group into a permutation
group, and asks GAP for an iterator thereupon through
libgap. However, for E8, this still can lead to overflowing GAP's
workspace. To be investigated.
This is fast for small groups, but uses up memory for E8 on my
machine:
To be investigated, but Coxeter3 probably builds the full group in memory.
CC: @sagetrac-sage-combinat
Component: combinatorics
Keywords: Coxeter groups, Chevie
Issue created by migration from https://trac.sagemath.org/ticket/9285
The text was updated successfully, but these errors were encountered: