2021-02-26 22:13:26 +0100 | received badge | ● Notable Question (source) |
2020-02-05 10:05:05 +0100 | received badge | ● Nice Question (source) |
2018-05-10 20:46:14 +0100 | received badge | ● Popular Question (source) |
2016-05-02 19:34:13 +0100 | received badge | ● Scholar (source) |
2016-05-01 02:59:30 +0100 | received badge | ● Student (source) |
2016-04-30 08:44:57 +0100 | received badge | ● Editor (source) |
2016-04-30 00:36:13 +0100 | asked a question | GCD of multivariable polynomials and conversion of Laurent polynomials to ordinary polynomials Let's assume that I am working with some set of Laurent polynomials in $\mathbb{C}[t_1^{\pm1}, \ldots, t_n^{\pm 1}]$. My first question: is there any method which would multiply elements of $R$ by a big enough monomial $t_1^{k_1}\cdot \ldots \cdot t_n^{k_n}$ to get rid of the negative powers and after that changed them to ordinary polynomials? I will consider resulting polynomials up to $t_1^{k_1}\cdot \ldots \cdot t_n^{k_n}$, so $k_i$'s don't matter that much as long as multiplication will result in a Laurent polynomial with non-negative powers (however I would like to avoid shifting exponents by some huge constant). At the moment I am using following workaround which I hope is redundant to some sage method. Where $R_{\text{ordinary}} = \mathbb{C}[t_1, \ldots, t_n]$ is passed as argument in the last method. My second and the most important question is how to fix the last method to return a polynomial which posses a gcd() method just like in this snippet which I've found in the documentation (I can't post a link due to insufficient karma): Unfortunately at the moment method change_laurent_poly_to_ordinary returns class of type MPolynomial_polydict which doesn't have gcd() method, what results in the following error after attempting to use them: I am working with sage version offered ... (more) |