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
Allow conversion of strings to iterated polynomial rings #13327
Comments
comment:2
Looks good to me. Maybe one could check
to be sure that it lands where it should ? |
comment:3
Attachment: trac_13327_string_to_iterated_mpolyring.patch.gz OK, added the check! |
comment:4
Ok, looks good to me. Positive review. By the way, what do you think of that :
|
comment:5
I think this is horrible, as well as
but some people think that it does not matter how something is printing and the name is meaningless. From my point of view, all generator names should be distinct and different from generator names used in the base ring (recursively). Note that if this is enforced, then it is not possible to create polynomial rings with symbolic coefficients, since "any name is in SR". Since such polynomials are important (at least to me), the first step is to have symbolic rings with only explicitly specified names allows as variables. Then constructors can check for name collisions. |
Reviewer: Frédéric Chapoton |
Merged: sage-5.4.beta1 |
It is possible to convert strings and symbolic expressions to iterated polynomial rings in a single variable, but not many if the string contains names of coefficients:
The patch introduces
gens_dict_recursive
method and uses it instead ofgens_dict
in the conversion code:Component: commutative algebra
Author: Andrey Novoseltsev
Reviewer: Frédéric Chapoton
Merged: sage-5.4.beta1
Issue created by migration from https://trac.sagemath.org/ticket/13327
The text was updated successfully, but these errors were encountered: