-
-
Notifications
You must be signed in to change notification settings - Fork 503
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
Implementing Additional Features for Lazy Formal Laurent Series #31899
Comments
Changed keywords from LazyPowerSeries, FormalSeries, GSoC to LazyPowerSeries, FormalSeries, GSoC21 |
comment:2
Let me note that the second case works already:
Here is, why this works: the relevant line in
It might be a good idea to briefly doctest this in the future I am not sure whether this is an efficient way to obtain the composition. But that's certainly not important now. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Commit: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Changed keywords from LazyPowerSeries, FormalSeries, GSoC21 to LazyPowerSeries, FormalSeries, gsoc2021 |
comment:13
superseded |
This ticket deals with implementing composition for a formal Laurent Series.
Conditions:
Given two formal Laurent series - f and g
f o g exists, if and only if:
This ticket is part of the meta ticket #31651
CC: @mantepse
Component: combinatorics
Keywords: LazyPowerSeries, FormalSeries, gsoc2021
Branch/Commit: u/gh-tejasvicsr1/implementing_additional_features_for_lazy_formal_laurent_series @
f304cb7
Issue created by migration from https://trac.sagemath.org/ticket/31899
The text was updated successfully, but these errors were encountered: