I want to check for irreducibility of moderate degree polynomials in
very large numbers of variables. A typical example is a 20 degree
polynomial in 21 variables. The polynomials are expressed as very
compact expressions, but blow up terribly if expanded out into
monomials.
Does sage have any ex
Hello,
I'm implementing a code generator for simulation of simplicity (a way
to handle degeneracies in exact geometric computation). This involves
constructing and analyzing polynomials over a number of coordinate
variables plus one special infinitesimal variable 'e'. For example,
here's the pol
On Aug 24, 2012, at 6:19 PM, Geoffrey Irving wrote:
> Hello,
>
> I'm implementing a code generator for simulation of simplicity (a way
> to handle degeneracies in exact geometric computation). This involves
> constructing and analyzing polynomials over a number of coordin
On Sat, Aug 25, 2012 at 4:39 AM, Volker Braun wrote:
> The <> notation creates Python variables of the same name, so you shouldn't
> use it together with the PolynomialRing(..., "e") constructor. Basically,
> you need to be aware that the the string label "a" can be attached to
> multiple Python v
On Sun, Aug 26, 2012 at 3:38 AM, Dima Pasechnik wrote:
> On 2012-08-25, Geoffrey Irving wrote:
>> On Aug 24, 2012, at 6:19 PM, Geoffrey Irving wrote:
>>
>>> Hello,
>>>
>>> I'm implementing a code generator for simulation of simplicity (a wa
On Sun, Aug 26, 2012 at 11:07 AM, Dima Pasechnik wrote:
> On 2012-08-26, Geoffrey Irving wrote:
>> On Sun, Aug 26, 2012 at 3:38 AM, Dima Pasechnik wrote:
>>> On 2012-08-25, Geoffrey Irving wrote:
>>>> On Aug 24, 2012, at 6:19 PM, Geoffrey Irving wrote:
>
Hello,
I am doing computations over the symbolic ring SR in order to (mostly)
preserve the structure of my expressions (e.g., (x+y)*(z+w) should
stay factored). Keeping the structure is important for later code
generation purposes.
I also frequently want to know whether two expressions are the s
On Sun, Aug 26, 2012 at 7:20 PM, Nils Bruin wrote:
> If you know the variables and that your coefficients will be integers, why
> don't you key the dictionary on the polynomials coerced into the appropriate
> polynomial ring, e.g. Z['x,y,z,w']? Then you can use the dictionary to look
> up the orig
Hello,
I recently used sage to write a code generation script for exact
geometric predicates:
https://github.com/otherlab/simplicity
Since it's a python script that imports sage, the simplicity script is
GPL. However, I want the C++ *output* of this script to be license
unencumbered, so tha
On Wed, Sep 26, 2012 at 6:03 PM, Robert Bradshaw
wrote:
> On Wed, Sep 26, 2012 at 4:28 PM, Geoffrey Irving wrote:
>> Hello,
>>
>> I recently used sage to write a code generation script for exact
>> geometric predicates:
>>
>> https://github.com/otherl
On Wed, Sep 26, 2012 at 10:42 PM, Robert Bradshaw
wrote:
> On Wed, Sep 26, 2012 at 8:54 PM, Geoffrey Irving wrote:
>> On Wed, Sep 26, 2012 at 6:03 PM, Robert Bradshaw
>> wrote:
>>> On Wed, Sep 26, 2012 at 4:28 PM, Geoffrey Irving wrote:
>>>> Hello,
>&
On Thu, Sep 27, 2012 at 11:50 AM, Johannes wrote:
> Hi,
> as far as I understand the GPL, I would say you can release the output
> of your script under every license you want to, as long as Sage is not
> necessary to _compile_ or _run_ the the c++ code.
Since my script copies bits of itself into
On Thu, Sep 27, 2012 at 12:16 PM, Johannes wrote:
> Am Do 27 Sep 2012 20:58:25 CEST schrieb Geoffrey Irving:
>> On Thu, Sep 27, 2012 at 11:50 AM, Johannes wrote:
>>> Hi,
>>> as far as I understand the GPL, I would say you can release the output
>>> of your sc
13 matches
Mail list logo
