> atan((exp(x) + x + 1)/(exp(x) - x - 1))
>
> There are two kernels here (exp(x) and x). I am not sure
> if Rioboo is used here, but at least some simplification
> is done.
I checked this example, the "Rioboo" (aka log2atan) is not used
here, for rewriting "i*log((A+i*B)/(A-i*B))" to sums of
> However, this is wrong more or less the in the same way as
> the x^(1/3) test that you try to make to work. So the change
> does not look as improvement: we make one borderline case
> work at expense of another borderline case...
I don't think it fails in the same way as x^(1/3).
S3 is a
oldk1331 wrote:
>
> The problem is about branch cuting:
>
> For Integers and Fractions, (-1/8)^(1/3) gives AlgebraicNumber
> containing (-1)^(1/3), avoids branch cuting.
>
> For numeric computing, for example Float, I think it's better
> to have signature:
> ^ : (%, Fraction Integer) -> %
>
On 01/23/2017 06:33 PM, Ralf Hemmecke wrote:
On 01/23/2017 06:52 PM, Martin Baker wrote:
I would like a Vector domain which implements AbelianGroup.
http://fricas.github.io/api/DirectProduct.html
Ralf
Thanks Ralf, just what I was looking for.
I did look on fricas.github.io but I only
On 01/23/2017 06:52 PM, Martin Baker wrote:
> I would like a Vector domain which implements AbelianGroup.
http://fricas.github.io/api/DirectProduct.html
Ralf
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe
I would like a Vector domain which implements AbelianGroup.
Unfortunately Vectors in FriCAS don't appear to implement AbelianGroup
because it needs to implement 0:% which it can't because the nearest
function in Vector is zero: NonNegativeInteger -> % but this needs to
know the number of
Martin Baker wrote:
>
> On 01/23/2017 04:58 PM, Waldek Hebisch wrote:
> > Note: I used wordInStrongGenerators as a helper
>
> I find it hard to understand the functions in PermutationGroup. Partly
> because I cant find any documentation (I searched the usual places but
> its easy to miss
Martin Baker wrote:
>
> On 01/23/2017 05:37 AM, Waldek Hebisch wrote:
> > Martin Baker wrote:
> >> Patch is here:
> >> https://github.com/martinbaker/fricasAlgTop/blob/master/permgrps1.patch
> > I have tried it now. AFAICS it is _extremally_ inefficient:
> >
On 01/23/2017 04:58 PM, Waldek Hebisch wrote:
Note: I used wordInStrongGenerators as a helper
I find it hard to understand the functions in PermutationGroup. Partly
because I cant find any documentation (I searched the usual places but
its easy to miss things) and its hard to follow the code
On 01/23/2017 05:37 AM, Waldek Hebisch wrote:
Martin Baker wrote:
Patch is here:
https://github.com/martinbaker/fricasAlgTop/blob/master/permgrps1.patch
I have tried it now. AFAICS it is _extremally_ inefficient:
coerce(symmetricGroup(4))@GroupPresentation crashes due to
running out of memory
A little example of using strong generators:
(1) -> s5 := symmetricGroup(5)$PGE
(1) <(1 2 3 4 5),(1 2)>
Type: PermutationGroup(Integer)
(2) -> initializeGroupForWordProblem(s5)
11 matches
Mail list logo
