2017-12-07 12:58:53 -0600 | received badge | ● Famous Question (source) |

2016-12-23 11:46:38 -0600 | received badge | ● Self-Learner (source) |

2016-12-23 11:46:38 -0600 | received badge | ● Teacher (source) |

2016-05-24 08:59:19 -0600 | received badge | ● Notable Question (source) |

2016-05-24 08:59:19 -0600 | received badge | ● Popular Question (source) |

2016-03-10 08:22:54 -0600 | received badge | ● Nice Question (source) |

2016-03-10 06:06:33 -0600 | answered a question | Elimination of variables in polynomial equation I was informed by Pierre-Jean Spaenlehauer that the Gröbner basis code in FGb solves the problem in about a minute. |

2016-03-09 15:06:52 -0600 | commented question | Elimination of variables in polynomial equation It's been running for a day without success. I remember that I had gotten something similar to work in less than an hour, in 2013; but too many of my brain cells died since then. Note that I.elimination_ideal([c1,c2]) already fails. I suspect that it should be possible to use the symmetry of the polynomials in some way or other. |

2016-03-09 06:04:47 -0600 | received badge | ● Student (source) |

2016-03-09 04:53:32 -0600 | asked a question | Elimination of variables in polynomial equation Hi, I'm trying to eliminate 5 variables from a system of 6 equations in 7 unknowns, to obtain a planar curve. Am I asking for too much? This is what I tried: Note that the system is symmetric in permutations of c1...c5, except for one equation that says that x is the cross-ratio of c1...c4. I'm all the more embarrassed because I already computed the solution some time ago, but forgot how: it should be a polynomial J of degree 30 in v and 16 in x. Many thanks in advance! Laurent |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.