On Mon, Jan 06, 2020 at 03:55:52PM +0100, Prof. Dr. Johannes Grabmeier FW wrote:
>
> I forgot about this (thank you for pointing it out again) and started
> interrupted work again. But the answer was not what I expected. I
> totally agree with the principles,
>
>
> "This is mainy issue of consistency: we build structures by
> recursion,?? so trivial cases are necessary as base case. ??Also, we
> like to?? use generic algorithms and they may need such trivial
> operations.?? So definitely they should be present. "
>
>
>
> but my question is, which application/generic algorithm right now uses
> that finite fields are trival??
Differential polynomials and differential operators. Constant
coefficient operators make sense and need trivial derivative on
base ring. If the drivative was reomoved, one could work around
problems caused by this. But it is simpler to have trivial
derivative...
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/20200107151016.GA17139%40math.uni.wroc.pl.
