On 1 October 2024 17:04:49 BST, Georgi Guninski <ggunin...@gmail.com> wrote:
>On Tue, Oct 1, 2024 at 5:59 PM Dima Pasechnik <dimp...@gmail.com> wrote:
>>
>> This is a usual discrepancy between the univariate and multi-variable
>> case: the backends are different, and probably the functionality
>> is not implemented in the univariate backend (Flint?).
>> I gather it can be implemented using a resultant computation.
>>
>
>I don't see why treat the univariate case differently with resultants.
>As the original msg shows, for `l=[x,x^2]` the univariate dependency
>is correctly computed almost surely with groebner basis.
>Observe that the algebraic dependency might be generated by several
>polynomials.
in the univariate case one can think of {(x,y)|P(x,y)=0}
as a rational curve with parametrisation given by (f(t),g(t)).
These "several polynomials" are factors of P(x,y), no?
Groebner basis won't help you here to find them.
And computing one resultant is very fast, compared to Groebner basis for the
ideal (f(t)-x, g(t)-y) with a monomial order eliminating t.
>
>This is an universal workaround for 1 var: just work over a ring with
>at least one more unused var.
>
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-devel/151F9478-D322-4D3A-ADA8-DCB58821277F%40gmail.com.
