On Friday, February 17, 2017 at 4:51:49 AM UTC, john_perry_usm wrote:
>
> On Thursday, February 16, 2017 at 1:46:18 AM UTC-6, Dima Pasechnik wrote:
>>
>>
>>
>> On Thursday, February 16, 2017 at 6:59:04 AM UTC, William wrote:
>>>
>>> **Disclaimer: I consider myself very naive about computational
The situation is as follows:
sage: R. = ZZ[]
sage: (2*a/b).factor()
2 * b^-1 * a
sage: (a/(2*b)).factor()
2^-1 * b^-1 * a
sage: (3*a/(2*b)).factor()
Traceback (most recent call last):
...
TypeError: Cannot multiply 3 * a and 2^-1 * b^-1 because they cannot be coerced
into a common universe
Howev
I asked Hans Schoenemann about this. Whilst Singular does support doing
Groebner bases over inexact fields, there is no error checking and so this
is not considered useful. It's only there for people who want to run the
computation and examine the output themselves and see if they think it is
m
On 17 February 2017 at 12:26, Clemens Heuberger
wrote:
>
> The situation is as follows:
>
> sage: R. = ZZ[]
> sage: (2*a/b).factor()
> 2 * b^-1 * a
> sage: (a/(2*b)).factor()
> 2^-1 * b^-1 * a
> sage: (3*a/(2*b)).factor()
> Traceback (most recent call last):
> ...
> TypeError: Cannot multiply 3 *
Hi all,
MPIR-3.0.0-alpha2 has now been released. This adds support for MinGW and
MSVC 2013, 2015 and 2017. There are no changes to the Linux build, except
slightly better tuning for Broadwell.
We plan to start doing release candidates (for Linux, at least) early next
week, with a final release at
Hi all,
We have decided to change the requirements for the ~2.5 year mathematical
software developer job opening we have at TU Kaiserslautern.
The main changes are to the type of person we are seeking. It now says we
are interested in candidates with an interest in either:
* algebra or number
