-
Notifications
You must be signed in to change notification settings - Fork 129
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
Linear combinations of set partitions #3944
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Some comments from just shortly looking at the changes.
Do you plan to have linear combinations for the other types of partitions as well?
From my view of not knowing anything about the concrete mathematics involved: I would expect that functions like +(::SetPartition, ::SetPartition)
and *(::RingElement, ::SetPartition)
exist and return a LinearSetPartition
. Is something like this sensible (in a mathematical sense) and planned to get added?
@mjrodgers please have a look at this, too |
This pull request extends the previous one by adding linear combinations of set-partitions. These appear for example in study of quantum groups (Moritz Weber) and more generally tensor categories (Ulrich Thiel). As a concrete example, one could use these objects to implement the Temperly-Lieb algebra/category in the future. @lgoettgens It is not clear to me what type the result of |
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #3944 +/- ##
==========================================
+ Coverage 84.00% 84.65% +0.64%
==========================================
Files 592 600 +8
Lines 81624 82554 +930
==========================================
+ Hits 68566 69883 +1317
+ Misses 13058 12671 -387
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Some more comments
Co-authored-by: Lars Göttgens <[email protected]>
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Some more comments
Co-authored-by: Lars Göttgens <[email protected]>
Co-authored-by: Lars Göttgens <[email protected]>
Co-authored-by: Lars Göttgens <[email protected]>
Co-authored-by: Lars Göttgens <[email protected]>
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Some more minor nitpicks. Once these are adapted, this is fine from my POV. (but @fingolfin asked @mjrodgers to review this as well in #3944 (comment))
Two additional things came to my mind while reading through this again. This is nothing that needs to be changed asap, just for @sebvz777 and @pinguly to think about for future work.
- The name
LinearPartition
seems kind of weird. Firstly, it is not anAbstractPartition
by itself, although the name may suggest that. Secondly, in the literature I found (and you referenced), these things are either called "linear combination of partitions" or "linear category of partitions", but never "linear partition". - For fixed
S
andT
andd
(third arg ofcompose
), the objects of typeLinearPartition{S,T}
form a ring. So it would make sense to think about adding a parent object (aka the ring itself) and implementing the ring interface from AA.
@lgoettgens Regarding the two additional remarks:
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I agree with this most recent batch of suggestions made by @lgoettgens and think this looks good to merge into experimental as an initial commit for this package.
…est, redundant brackets removal etc
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
All comments from above are resolved now. Once the doctests are happy, this is good to go from my POV. The above snipped should be enough to fix the doctests (I think)
Co-authored-by: Nicolas <[email protected]> Co-authored-by: Lars Göttgens <[email protected]> Co-authored-by: pinguly <[email protected]>
We added the implementation of linear combinations of set-partitions.
See for example Chapter 5 in [Gro20] in the Oscar references.