2020-04-17 14:23:59 +0200 | received badge | ● Notable Question (source) |

2020-01-18 13:58:45 +0200 | received badge | ● Famous Question (source) |

2016-11-22 19:24:39 +0200 | received badge | ● Notable Question (source) |

2015-01-14 14:40:00 +0200 | received badge | ● Popular Question (source) |

2014-04-07 23:51:30 +0200 | received badge | ● Popular Question (source) |

2012-03-16 10:49:30 +0200 | received badge | ● Student (source) |

2012-03-06 12:34:42 +0200 | asked a question | SAGBI-Grobner basis of an invariant polynomial system Hi all! I've been looking into the SAGBI-Grobner basis and I gave it a test drive. My very simple multivariate system is invariant and I want to find its SAGBI basis via the Singular library. I'm pretty sure the code below produces The last polynomial is in fact Thank you in advance, Sash |

2011-11-26 09:53:31 +0200 | commented answer | Basis of invariant polynomial system update: there is a sagbipart(...) function which "performs k iterations of the SAGBI construction algorithm for the subalgebra given by the generators given by (the ideal) A". I'm aware this is not the same as "computing SAGBI basis of up to arbitrary degree", but it might, in practice, have very similar effect. how wrong am i ? Further, there doesn't seem to be a way to specify the invariance group to the system. Is it computed or what? Thanks! |

2011-11-26 09:35:27 +0200 | commented answer | Basis of invariant polynomial system This is great! I'm gonna give the SAGBI basis a go today, will report...thanks again! |

2011-11-26 09:28:30 +0200 | commented answer | Basis of invariant polynomial system Thank you very much for your help Simon, very insightful. Let's assume there is a way to get a univariate polynomial from the truncated Grober basis. Since "information was lost", as you adequately put it, any actual solution arising from this potential univariate polynomial will in fact be wrong, right? |

2011-11-26 08:56:03 +0200 | received badge | ● Scholar (source) |

2011-11-26 08:56:03 +0200 | marked best answer | Basis of invariant polynomial system Hooray, there It is not totally staight forward to use it in Sage, because your base ring is a function field, and even though Singular itself can deal with it, lib_singular (which is used for many polynomial rings) cannot handle it, yet. So, you could try it via the pexpect interface (see the Sage reference manual): However, it doesn't seem to be an easy problem - I give no guarantee that it will soon finish. Also, it seems that it can not be used with a degree bound; at least, the Singular manual does not mention it. |

2011-11-24 17:03:53 +0200 | commented answer | Basis of invariant polynomial system Sorry for the missing data. I have updated the question, attaching the problem definition. |

2011-11-24 13:48:39 +0200 | received badge | ● Supporter (source) |

2011-11-24 13:48:36 +0200 | received badge | ● Editor (source) |

2011-11-24 13:20:32 +0200 | asked a question | Basis of invariant polynomial system I've been trying to compute a Grobner basis for a specific invariant polynomial system. It has 6 variables, 6 constants and 6 equations and is invariant to a group of cardinality 2. Various algorithms have been ran on it, including FGb/Gb through Maple and Singular through SAGE system. In both cases, the invariance was ignored and the computation of the Grobner basis failed to finish after hours (sometime days) of computation, while occupying all the memory available. Please note, I do not know what exactly the underlying algorithm was (Buchberger/F4/F5...). It is an engineering application and in practice, I would only need the first few polynomials of the Grobner basis, that is the ones with as low degree as possible. I'm an engineer not a mathematician, so my knowledge of the topic is very limited. I did however understood, that in case of invariant systems, a SAGBI basis (or invariant Grobner basis) can be computed much more efficiently. More important, the invariant Grobner basis can be computed "up to a given degree", which is exactly what I probably need. I got a hint that such algorithm might exist in SAGE. I've been searching through the SAGE documentation, but it seems I don't know what to search for and the system is huge. If anyone can point me to right direction it would be great! The problem: Where X0,X1,X2,Y0,Y1,Y2 are variables S0...S5 are constants, all are complex numbers. |

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.