I have a simplicial complex than I can find (in SAGE) the Stanly Riesner
ring with respect to simplicial complex.But i want the reverse direction
(i.e) I have a square free monomial ideal.Can i find the Stanlely Riesner
complex of ideal?
--
You received this message because you are subscri
from sympy.solvers import solve
from sympy import *
P, K, L, PL, Pt, Lt= symbols('P, K, L, PL, Pt, Lt')
solve([K-(P * L)/PL, Pt- P - PL, Lt- L - PL], P,L,PL)
[(-K/2 - Lt/2 + Pt/2 - sqrt(K**2 + 2*K*Lt + 2*K*Pt + Lt**2 - 2*Lt*Pt +
Pt**2)/2,
-K/2 + Lt/2 - Pt/2 - sqrt(K**2 + 2*K*Lt + 2*K*Pt + Lt
> I trust that you know the proper order of these powerful French words
> starting from p and m better than me. ;-)
I sent them an email asking if anything had been done about this bug,
and saying that we would remove the code otherwise.
Nathann
--
You received this message because you are sub
On Friday, 8 May 2015 14:06:58 UTC+1, Nathann Cohen wrote:
>
> > maybe we should just keep posting strong-worded statements about quality
> of
> > that code,
> > perhaps in French ;-)
>
> I prefer your technique. You are waiting for me to do something about it,
> right?
>
I trust that you
> maybe we should just keep posting strong-worded statements about quality of
> that code,
> perhaps in French ;-)
I prefer your technique. You are waiting for me to do something about it, right?
Nathann
--
You received this message because you are subscribed to the Google Groups
"sage-support
On Friday, 8 May 2015 10:13:26 UTC+1, Nathann Cohen wrote:
>
> > Was it about the same version of their code?
>
> I cannot swear that they have not changed a single character of their
> code in the meantime. What I can tell for sure is that the same error
> still exists at the same line of the
> Was it about the same version of their code?
I cannot swear that they have not changed a single character of their
code in the meantime. What I can tell for sure is that the same error
still exists at the same line of their file, on the copy I downloaded
this morning.
> Maybe we should tell the
On Friday, 8 May 2015 09:27:57 UTC+1, Nathann Cohen wrote:
>
> Small update on the 'modular decomposition story'.
>
> Today I ran valgrind on the code, and ended up finding where the error
> comes from. Around line 972 of dm.c, one can find:
>
> for(v = n-1; v>=0; v--)
> if(ds[v-1]
Le 08/05/2015 11:00, Vincent Delecroix a écrit :
On 08/05/15 10:52, Thierry Dumont wrote:
Le 08/05/2015 10:23, Vincent Delecroix a écrit :
Bonjour Thierry,
Could you post your matrices Prec, M, mfeEast? I am not able to
reproduce the problem with change_ring...
Vincent
Hello Vincent.
Yes,
On 08/05/15 11:00, Vincent Delecroix wrote:
> On 08/05/15 10:52, Thierry Dumont wrote:
>> Le 08/05/2015 10:23, Vincent Delecroix a écrit :
>>> Bonjour Thierry,
>>>
>>> Could you post your matrices Prec, M, mfeEast? I am not able to
>>> reproduce the problem with change_ring...
>>>
>>> Vincent
>>>
>
On 08/05/15 10:52, Thierry Dumont wrote:
> Le 08/05/2015 10:23, Vincent Delecroix a écrit :
>> Bonjour Thierry,
>>
>> Could you post your matrices Prec, M, mfeEast? I am not able to
>> reproduce the problem with change_ring...
>>
>> Vincent
>>
>
> Hello Vincent.
> Yes,
> I join a part of my code,
Le 08/05/2015 10:23, Vincent Delecroix a écrit :
Bonjour Thierry,
Could you post your matrices Prec, M, mfeEast? I am not able to
reproduce the problem with change_ring...
Vincent
Hello Vincent.
Yes,
I join a part of my code, which reproduces the problem...
Yours
t.
--
You received this me
Newton method is not useful to find all roots, it is useful to find one
solution and refine approximate solutions.
Built-in Sage solution: no that I know of.
Doable: certainly for a large class of functions that do have a
controlled behavior at infinity. You just need to localize the roots and
th
Small update on the 'modular decomposition story'.
Today I ran valgrind on the code, and ended up finding where the error
comes from. Around line 972 of dm.c, one can find:
for(v = n-1; v>=0; v--)
if(ds[v-1] != -1){
L2[v]=v;
while( pile[sommet] < ds[v-1])
Bonjour Thierry,
Could you post your matrices Prec, M, mfeEast? I am not able to
reproduce the problem with change_ring...
Vincent
On 08/05/15 09:15, Thierry Dumont wrote:
> Hello,
>
> I have 2 matrices: Prec and M.
>
>>sage: Prec.parent
> Full MatrixSpace of 4 by 4 dense matrices over Rationa
I know the Newton method.
My question: is there built-in support in sage and how in general find all
roots? You've got approximate solution, but there is another one.
On Thursday, May 7, 2015 at 12:59:22 PM UTC+3, vdelecroix wrote:
>
> On 06/05/15 14:55, Paul Royik wrote:
> > For example,
> > x
Hello,
I have 2 matrices: Prec and M.
>sage: Prec.parent
Full MatrixSpace of 4 by 4 dense matrices over Rational Field
>sage: M.parent()
Full MatrixSpace of 4 by 4 dense matrices over Rational Field
>sage: Prec.is_symetric()
True
ok. I also know that Prec is positive. Then, I do:
>sage: LC=Pre
17 matches
Mail list logo
