-
-
Notifications
You must be signed in to change notification settings - Fork 548
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 virtual Klebers algorithm #13838
Comments
Dependencies: #13871 |
comment:4
Attachment: trac_13871-virtual_cartan_type-ts.patch.gz Since I attached the wrong patch... For patchbot: Apply only: trac_13838-virtual_kleber_alg-ts.patch |
comment:5
New version based over the changes in #13871. For patchbot: Apply: trac_13838-virtual_kleber_alg-ts.patch |
comment:7
New version with (trivial) rebase over #14469. For patchbot: Apply: trac_13838-virtual_kleber_alg-ts.patch |
comment:9
New version over changes in #13871. For patchbot: Apply: trac_13838-virtual_kleber_alg-ts.patch |
comment:10
Hello,
|
comment:11
With added arXiv role, fixed the typo, and bringing the doc up to new specs. Thanks for having a look at this Frederic. For patchbot: Apply: trac_13838-virtual_kleber_alg-ts.patch |
comment:12
Hi Travis, It would be good if you could implement the tensor product multiplicity (and please call it tensor_product_multiplicity) which is formula (3.2) of http://arxiv.org/pdf/math/9809087.pdf in order to check that the code is giving the correct output. For nonsimply-laced types it would be the virtual analogue of this formula. The Kleber tree gives the admissible partitions, but to get the multiplicity one needs to sum over the product of binomial coefficients. Also, I think it would be better to access the VirtualKleberTree through its own class (rather than through KleberTree). It is fine to inherit from KleberTree, but the construction is mathematically inherently different. For example for type Thanks for your work on this! Anne |
comment:13
Hey Anne, Here's the new version with the changes we've discussed (via e-mail/in person) along with a method Thank you for doing the review, Travis For patchbot: Apply: trac_13838-virtual_kleber_alg-ts.patch |
comment:14
Hi Travis, If you want to allow for simply-laced input in the VirtualKleberTree, don't you want to select all nodes and bracket them in the output? Otherwise the behavior is different from the simply-laced and non-simply-laced types. If it is really just the same as the usual KleberTree, then why not make them equal in this case? Best, Anne |
New version |
This comment has been minimized.
This comment has been minimized.
comment:15
Attachment: trac_13838-virtual_kleber_alg-ts.patch.gz Hey Anne, I made it raise an error on simply-laced types. Best, Travis For patchbot: Apply: trac_13838-virtual_kleber_alg-ts.patch |
comment:16
Hi Travis, Looks good now (you want to add a test for the simply-laced types in the VirtualKleberTree for completeness). Anne |
Changed keywords from none to rigged configurations |
Reviewer: Anne Schilling |
Merged: sage-5.13.beta0 |
The current implementation of
KleberTree
is only valid for the simply laced types. This ticket will implement the virtual Kleber algorithm and thus expandKleberTree
to generate rigged configurations for all affine types.Apply: attachment: trac_13838-virtual_kleber_alg-ts.patch
Depends on #13871
Depends on #14469
CC: @sagetrac-sage-combinat @anneschilling
Component: combinatorics
Keywords: rigged configurations
Author: Travis Scrimshaw
Reviewer: Anne Schilling
Merged: sage-5.13.beta0
Issue created by migration from https://trac.sagemath.org/ticket/13838
The text was updated successfully, but these errors were encountered: