-
-
Notifications
You must be signed in to change notification settings - Fork 688
Implement the atom (Demazure) basis (in type A) for the polynomial rings. #41026
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
base: develop
Are you sure you want to change the base?
Conversation
516adc2 to
35d0dea
Compare
| EXAMPLES:: | ||
| sage: k = KeyPolynomials(QQ) | ||
| sage: k._monomial(k._indices([1, 3, 2, 0, 2])) |
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.
Should this be moved to tests, since underscore methods are generally hidden from users?
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.
There’s no point since the method is hidden from the doc anyways. (Separately, I also don’t think we should hide such tests/examples in general.)
| sage:a = AtomPolynomials(ZZ) | ||
| sage: X = SchubertPolynomialRing(ZZ) | ||
| sage: it = iter(Permutations()) | ||
| sage: for _ in range(50): |
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.
The bot is showing a failed example here
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.
The last push should fix it.
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.
My only comment is that src/sage/combinat/schubert_polynomial.py has the round trip from atom polynomials test failing. Other than that it looks good to me.
|
LGTM. |
|
Thank you. Although something is (still) going wrong with the docbuild according to the bot. |
|
Documentation preview for this PR (built with commit 5cc1c8d; changes) is ready! 🎉 |
|
Okay, now everything should work. |
|
LGTM. Thanks for the update. |
sagemathgh-41026: Implement the atom (Demazure) basis (in type A) for the polynomial rings. <!-- ^ Please provide a concise and informative title. --> <!-- ^ Don't put issue numbers in the title, do this in the PR description below. --> <!-- ^ For example, instead of "Fixes sagemath#12345" use "Introduce new method to calculate 1 + 2". --> <!-- v Describe your changes below in detail. --> <!-- v Why is this change required? What problem does it solve? --> <!-- v If this PR resolves an open issue, please link to it here. For example, "Fixes sagemath#12345". --> This extends the framework for the key basis so that we can also perform computations in the atom basis. ### 📝 Checklist <!-- Put an `x` in all the boxes that apply. --> - [x] The title is concise and informative. - [x] The description explains in detail what this PR is about. - [x] I have linked a relevant issue or discussion. - [x] I have created tests covering the changes. - [x] I have updated the documentation and checked the documentation preview. ### ⌛ Dependencies <!-- List all open PRs that this PR logically depends on. For example, --> <!-- - sagemath#12345: short description why this is a dependency --> <!-- - sagemath#34567: ... --> URL: sagemath#41026 Reported by: Travis Scrimshaw Reviewer(s): Travis Scrimshaw, trevorkarn
This extends the framework for the key basis so that we can also perform computations in the atom basis.
📝 Checklist
⌛ Dependencies