Next Update....

[Sid Andal]

Does anyone know the approx release date (if any) for the next FriCAS update? The current stable release, 1.3.6, is more than a year old....

[Ralf Hemmecke]

> Does anyone know the approx release date (if any) for the next FriCAS
> update? The current stable release, 1.3.6, is more than a year old....

I maybe should leave the answer to Waldek, but I guess there is chance
for a release in April.

Ralf

[Waldek Hebisch]

On Mon, Mar 29, 2021 at 01:10:59PM -0700, Sid Andal wrote:
>
> Does anyone know the approx release date (if any) for the next FriCAS
> update? The current stable release, 1.3.6, is more than a year old....

Very soon. There is a bunch of fixes to polish and merge, it
will take some days (hopefully no more than two weeks).

--
Waldek Hebisch

[Sid Andal]

In addition to bug fixes are there going to be any new functionalities? I'm particularly interested in general/nonassociative Algebras over finite fields and such, with, possibly, many n-ary types of products, etc.

Thanks.

--
You received this message because you are subscribed to a topic in the Google Groups "FriCAS - computer algebra system" group.
To unsubscribe from this topic, visit https://groups.google.com/d/topic/fricas-devel/dvhKrMgJOnU/unsubscribe.
To unsubscribe from this group and all its topics, send an email to fricas-devel...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/fricas-devel/20210330121228.GA6144%40math.uni.wroc.pl.

[Waldek Hebisch]

On Wed, Mar 31, 2021 at 11:16:40AM -0500, Sid Andal wrote:
> In addition to bug fixes are there going to be any new functionalities?

Yes. Probably most important are new formatters by Ralf.

> I'm
> particularly interested in general/nonassociative Algebras over finite
> fields and such, with, possibly, many n-ary types of products, etc.

There are only tiny changes there. To say the truth, new things
appear when somebody writes code implementing them. And people
tend to write code when there is something which can be computed
with resonable effort. Are there computable things which
work for general/nonassociative algebras? It seems that
efficient computation requires regular structure which is
rather different than "general". In direction of general algebra
we could probably implement free algebras. Currently there
is FreeMagma, that is free algebra with one binary operation.
OTOH FreeMagma is used to implement Lyndon words and free Lie
algebras. I am not sure how useful are other free algebras.

--
Waldek Hebisch