Perhaps you can try using different colors instead of different line
styles. There is an option called 'color_by_label', where you can set a
label for some edges and color them accordingly.
On Wednesday, May 28, 2014 6:29:31 AM UTC+8, Ursula Whitcher wrote:
>
> Is it possible to display a direc
On 2014-05-30, William Stein wrote:
> On Fri, May 30, 2014 at 10:01 AM, Robert Godfroid
> wrote:
>> host: Windows 8.1
>> VirtualBox 4.3.12
>> guest: Ubuntu 14.04 LTS
>> Sage 6.2 Release Date 2014-05-06
>>
>> Statements that gave rise to the error:
>> A5 = AlternatingGroup(5)
>> A5_sgs = A5.subgrou
leif wrote:
Stephen Kauffman wrote:
I'm trying to become cognizant of your caveats about conversion. What
I've tried to write is a recursive function to convert polynomials
(statements) in the Free BooleanPolynomialRing() to corresponding
probability polynomials (statements) over QQ. I haven't c
Stephen Kauffman wrote:
I'm trying to become cognizant of your caveats about conversion. What I've
tried to write is a recursive function to convert polynomials (statements) in
the Free BooleanPolynomialRing() to corresponding probability polynomials
(statements) over QQ. I haven't convinced m
On Fri, May 30, 2014 at 10:01 AM, Robert Godfroid
wrote:
> host: Windows 8.1
> VirtualBox 4.3.12
> guest: Ubuntu 14.04 LTS
> Sage 6.2 Release Date 2014-05-06
>
> Statements that gave rise to the error:
> A5 = AlternatingGroup(5)
> A5_sgs = A5.subgroups()
> len(A5_sgs)
>
> =>
> ...
> RuntimeError:
host: Windows 8.1
VirtualBox 4.3.12
guest: Ubuntu 14.04 LTS
Sage 6.2 Release Date 2014-05-06
Statements that gave rise to the error:
A5 = AlternatingGroup(5)
A5_sgs = A5.subgroups()
len(A5_sgs)
=>
...
RuntimeError: Gap produced error output
Error, sorry, the GAP Tables of Marks Library is not ins
On Fri, May 30, 2014 at 9:14 AM, John Cremona wrote:
> On 30 May 2014 15:57, Peter Mueller wrote:
>> The lines
>>
>> sage: k. = FunctionField(QQ)
>> sage: R. = k[]
>> sage: l. = k.extension(X^3+n-1)
>> sage: E = EllipticCurve(l,[0,n])
>> sage: print 1 == x^3+n
>> True
>>
>> show that the point (x
I'm trying to become cognizant of your caveats about conversion. What I've
tried to write is a recursive function to convert polynomials (statements) in
the Free BooleanPolynomialRing() to corresponding probability polynomials
(statements) over QQ. I haven't convinced myself that it's correct, b
On 30 May 2014 15:57, Peter Mueller wrote:
> The lines
>
> sage: k. = FunctionField(QQ)
> sage: R. = k[]
> sage: l. = k.extension(X^3+n-1)
> sage: E = EllipticCurve(l,[0,n])
> sage: print 1 == x^3+n
> True
>
> show that the point (x,1) lies on the elliptic curve E, which is defined
> over l too.
>
On Friday, May 30, 2014 7:57:34 AM UTC-7, Peter Mueller wrote:
>
> However, E(x,1) fails with an intimidating traceback, with the last line
> being
>
(Intimidating but extremely informative)
AttributeError: 'FunctionField_polymod_with_category' object has no
> attribute 'parent'
>
> Am I doing s
The lines
sage: k. = FunctionField(QQ)
sage: R. = k[]
sage: l. = k.extension(X^3+n-1)
sage: E = EllipticCurve(l,[0,n])
sage: print 1 == x^3+n
True
show that the point (x,1) lies on the elliptic curve E, which is defined
over l too.
However, E(x,1) fails with an intimidating traceback, with the l
John Cremona wrote:
On 30 May 2014 12:37, Simon King wrote:
Hi!
On 2014-05-30, kundan kumar wrote:
Does sage have an implementation of Bivariate polynomial Euclid's division
algorithm?
Yes, that's known as normal form computation in commutative algebra.
In particular, I want to divide f(
Kannappan Sampath wrote:
On Fri, May 30, 2014 at 12:17 AM, William Stein mailto:wst...@gmail.com>> wrote:
Simon -- great answer -- like my second one but even better. This
seems like the sort of thing our FAQ should have. Believe it or not,
we have a Sage FAQ:
http://sagemath
+1 for fantastic mini-tutorial
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to sa
On 30 May 2014 12:37, Simon King wrote:
> Hi!
>
> On 2014-05-30, kundan kumar wrote:
>> Does sage have an implementation of Bivariate polynomial Euclid's division
>> algorithm?
>
> Yes, that's known as normal form computation in commutative algebra.
>
>> In particular, I want to divide f(x) = x^p
It works for me.
My guess would be that you somehow damaged the virtual disk image. Can you
delete it in virtualbox and import the ova again?
On Friday, May 30, 2014 7:37:15 AM UTC+1, Henry Leung wrote:
>
> I cannot open sage-6.2 from virtual box for second time.
>
> I can open it the first t
Hi!
On 2014-05-30, kundan kumar wrote:
> Does sage have an implementation of Bivariate polynomial Euclid's division
> algorithm?
Yes, that's known as normal form computation in commutative algebra.
> In particular, I want to divide f(x) = x^p - 1 by g(x,y) = (x-y)^2 - c.
> Here, p is a large
I cannot open sage-6.2 from virtual box for second time.
I can open it the first time. But ever since then, it goes into the
loading screen. then it just when it is starting, it stays in the black
screen and then the window just closes. How to fix this problem?
On Monday, May 19, 2014 11:59
Hi,
Does sage have an implementation of Bivariate polynomial Euclid's division
algorithm?
In particular, I want to divide f(x) = x^p - 1 by g(x,y) = (x-y)^2 - c.
Here, p is a large prime. The division occur in F[y] / (y^7 - 1) where F is
a finite field(Z mod p).That is while applying division
19 matches
Mail list logo
