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
Implement Q-basis and fundamental basis of WQSym #25151
Comments
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
comment:4
I'll keep trying to code something but I think realistically this is beyond me. |
Last 10 new commits:
|
Branch: public/ticket/25151 |
Author: Darij Grinberg |
Commit: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:
|
comment:10
Done: both bases implemented, and product on Q-basis overloaded. Worth doing: overload product and coproduct on Phi-basis (Novelli and Thibon give formulas for them, but they take some time to unravel), and search for a coproduct formula on Q-basis. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:13
Ok, shall I try to understand the product and coproduct of Phi, and give that to you mathematically / pseudocode-ly? |
comment:14
That would be great! |
comment:15
Actually the product and coproduct on the Phi basis are quite easy to understand. But they are in terms of segmented permutations - i.e. think of the ordered set partition as a word/permutation with some bars. Because we need ideas like shuffle and deconcatenate.
My best idea for how to do this:
Then we can compute shuffle and deconcatenation in the permutation/composition format. If you think it is useful, I can try to code the functions osp->permutation and (permutation,composition)->osp . But it will be of the level at #25152. Not sure if that's too rudimentary to be useful. Sorry not to be of much help. Thanks Darij for all the coding so far. |
Reviewer: Mike Zabrocki |
Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. Last 10 new commits:
|
comment:33
Essentially a trivial rebase over #25141. |
Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. New commits:
|
comment:37
There was a conflict in reference/references/index.rst. Also I pulled in the most recent versions of the dependencies. |
comment:38
Documentation is not building with this branch. You introduced a duplicate of the |
comment:40
Likely the result of a bad merge. Fixed (including verified the doc builds). |
Changed branch from public/ticket/25151 to |
Please implement
-the Q basis, as in Bergeron-Zabrocki https://arxiv.org/abs/math/0509265 start of section 6
-the Phi basis, as in Novelli-Thibon https://arxiv.org/abs/math/0605061 lines 55-56
Define an order on ordered-set-partitions: u<v if v can be obtained by merging adjacent parts of u, where all numbers in the left part are smaller than all numbers in the right part.
Q_u is the sum of M_w over all w>u;
Phi_v is the sum of M_w over all w<v.
Depends on #25133
Depends on #25136
Depends on #25141
CC: @darijgr @tscrim @zabrocki @saliola @alauve
Component: combinatorics
Keywords: IMA coding sprint, CHAs
Author: Darij Grinberg
Branch/Commit:
e13a0ce
Reviewer: Mike Zabrocki
Issue created by migration from https://trac.sagemath.org/ticket/25151
The text was updated successfully, but these errors were encountered: