-
-
Notifications
You must be signed in to change notification settings - Fork 514
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
Implementation of the SubwordComplex as defined by Knutson and Miller #11010
Comments
Author: Christian Stump |
This comment has been minimized.
This comment has been minimized.
Changed keywords from none to subword complex, simplicial complex |
This comment has been minimized.
This comment has been minimized.
Dependencies: 11187, 11122 |
comment:7
Replying to @fchapoton: Okay, I must confess that I tend to not finish implementations once the patch does what I want it to do... The dependencies of this patch must (unfortunately) inherit as well the dependencies of #11122. This is to say that this patch actually relies on many things implemented in #11187. I would be very, very glad if anyone would finally start reviewing the universal cyclotomic field, #8327 on which #11187 depends (I would first need to rebase it, and make sure that the trac version is updated to the newest version on the combinat queue). Cheers, Christian |
Attachment: trac_11010-subword_complex-cs.patch.gz |
Branch: u/chapoton/11010 |
Commit: |
comment:11
The code needs to be 100% doctested. Some empty methods should be removed. |
Work Issues: coverage |
comment:70
Does the plotting also work for type C, being that it is the dual of type B (and we are dealing with Cartan types)? |
comment:71
I am rather confused now:
In particular, the root systems Also, the plotting now assumes that the first index is the type B/C special one. This is, it is expected that
I doubt that this is correct in the current implementation of |
comment:72
The first issue is the result of my quick hacking to get something working. The Coxeter matrices are equal for the Cartan types B and C, and the Coxeter matrix is the information passed to the For the second issue, yes, you are correct. The |
comment:73
I also have the problem that the plot only allows irreducible types. When playing with reducible types, I got to the types B vs. G bug in #19830... |
Changed branch from u/chapoton/11010 to u/stumpc5/11010 |
comment:77
Not quite, I wanted to add a few more doctests for the type B plotting with various indexing sets. But then saw that the indexing in |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:81
ok, good enough for me. I have made two minor doc changes, and now set this again to positive review. Any further changes will have to be in another ticket. New commits:
|
Changed branch from u/stumpc5/11010 to u/chapoton/11010 |
Changed branch from u/chapoton/11010 to |
This patch provides an implementation of the subword complex:
Fix a Coxeter system (W,S). Let Q = be a finite word in S and pi in W.
The subword complex Delta(Q,pi) is then defined to be the simplicial complex with vertices being {0,...,n-1}, (n = len(Q), one vertex for each letter in Q) and with facets given by all (indices of) subwords Q' of Q for which Q\Q' is a reduced expression for pi.
Component: combinatorics
Keywords: subword complex, simplicial complex
Author: Christian Stump
Branch/Commit:
17518c1
Reviewer: Frédéric Chapoton
Issue created by migration from https://trac.sagemath.org/ticket/11010
The text was updated successfully, but these errors were encountered: