Your code, after the patch, seems to work (I tested it on all graphs
with 8 vertices, and it doesn't fail), but I think it differs from
what the paper does.
The first difference is that, after LexBFS, the current code processes
the vertices in the PEO order, and chooses the first violating vertex.
How to calculate inverse of a polynomial f(x) modulo g(x) in the finite
field GF(2^10)?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://grou
On Aug 22, 12:35 pm, William Stein wrote:
> > Also, I think "f(x)" is more explicit than "f (x)".
>
> > I never use "f (x)" in Python code and wonder why it is even allowed
> > in Python instead of raising an exception.
>
> Wow, that's almost as bad as "I didn't put any cheese on the eggs for
>
Can't reach www.sagemath.org or www.sagenb.org. Has anybody else same
problems? Was that somewhere announced?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this
On Thu, Aug 25, 2011 at 9:34 AM, jernej wrote:
> Can't reach www.sagemath.org or www.sagenb.org. Has anybody else same
> problems? Was that somewhere announced?
Hi, There was a new firewall installed in the mathematics building,
and they forgot to punch a whole through for me. It should be fixed
Hi Santanu!
On 25 Aug., 18:03, Santanu Sarkar
wrote:
> How to calculate inverse of a polynomial f(x) modulo g(x) in the finite
> field GF(2^10)?
The usual way to compute modular inverses in a polynomial ring over a
field is the extended Euclidean algorithm, xgcd.
We start with a polynomial ring
On 8/25/11 12:32 PM, William Stein wrote:
On Thu, Aug 25, 2011 at 9:34 AM, jernej wrote:
Can't reach www.sagemath.org or www.sagenb.org. Has anybody else same
problems? Was that somewhere announced?
Hi, There was a new firewall installed in the mathematics building,
and they forgot to punch a
Dear Simon,
Thanks a lot.
With regards,
Santanu
On 25 August 2011 23:02, Simon King wrote:
> Hi Santanu!
>
> On 25 Aug., 18:03, Santanu Sarkar
> wrote:
> > How to calculate inverse of a polynomial f(x) modulo g(x) in the finite
> > field GF(2^10)?
>
> The usual way to compute modular inverses
On Thu, Aug 25, 2011 at 10:36 AM, Jason Grout
wrote:
> On 8/25/11 12:32 PM, William Stein wrote:
>>
>> On Thu, Aug 25, 2011 at 9:34 AM, jernej wrote:
>>>
>>> Can't reach www.sagemath.org or www.sagenb.org. Has anybody else same
>>> problems? Was that somewhere announced?
>>
>> Hi, There was a new
On trying to use sage and LaTeX, with code at:
http://www.sagemath.org/doc/tutorial/sagetex.html
It resulted in error:
http://paste.ubuntu.com/674698/
May I request to let me know what mistake I am committing?
With regards,
--
H.S.Rai
--
To post to this group, send email to sage-support@go
Should this be a feature of an element of a finite field? As you point
out, it doesn't seem too hard to implement, and would seem to be an
important feature.
john perry
On Aug 25, 12:32 pm, Simon King wrote:
> Hi Santanu!
>
> On 25 Aug., 18:03, Santanu Sarkar
> wrote:
>
> > How to calculate inv
On 8/25/11 12:52 PM, William Stein wrote:
On Thu, Aug 25, 2011 at 10:36 AM, Jason Grout
wrote:
On 8/25/11 12:32 PM, William Stein wrote:
On Thu, Aug 25, 2011 at 9:34 AM, jernejwrote:
Can't reach www.sagemath.org or www.sagenb.org. Has anybody else same
problems? Was that somewhere anno
I generate integers from [0,63] and I always want to expressed as 6 bit
integer and store in an array of length 6.
So,
1= 01
2=10
like this way.
Is there any such approach in Sage?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, se
I'd been running some computations on sagenb.org which involved
(implicitly) asking Singular to make some groebner basis
calculations. I was never able to complete it because it would
eventually appear to finish, but at that point it acted as though the
worksheet was restarted (and silently -- at
On Thu, Aug 25, 2011 at 12:19 PM, Jason Grout
wrote:
> On 8/25/11 12:52 PM, William Stein wrote:
>>
>> On Thu, Aug 25, 2011 at 10:36 AM, Jason Grout
>> wrote:
>>>
>>> On 8/25/11 12:32 PM, William Stein wrote:
On Thu, Aug 25, 2011 at 9:34 AM, jernej
wrote:
>
> Can't reach
This is already implemented in the sage i'm running (4.7.2.alpha2)
sage: P. = GF(2^10,'z')[]
sage: p = P.random_element()
sage: q = P.random_element()
sage: p.inverse_mod(q)
(z^7 + z^6 + z^5 + z^4 + z^3 + z^2 + z)*x + z^2 + z
--
To post to this group, send email to sage-support@googlegroups.com
Dear Santanu,
I noticed that you asked quite a few "easy" questions in the last few day.
It might be usefull for you to walk trough a sage tutorial (to be found at
http://www.sagemath.org/doc/tutorial/ as soon as the site is working again)
and a python tutorial (since everything you can do in
I could be wrong, but I think that sagenb.org has a timeout on all
computations, which may be different than any timeout due to idleness. It
may reset everything every 10 minutes or so, to prevent long-running or
otherwise intensive computations from using up all of the resources on the
server.
So
On Thu, Aug 25, 2011 at 4:55 PM, Jonathan Bober wrote:
> I could be wrong, but I think that sagenb.org has a timeout on all
> computations, which may be different than any timeout due to idleness. It
> may reset everything every 10 minutes or so, to prevent long-running or
> otherwise intensive co
On Thu, 25 Aug 2011 at 11:56PM +0530, H.S.Rai wrote:
> On trying to use sage and LaTeX, with code at:
>
> http://www.sagemath.org/doc/tutorial/sagetex.html
>
> It resulted in error:
>
> http://paste.ubuntu.com/674698/
>
> May I request to let me know what mistake I am committing?
Without knowi
Let g be a semisimple Lie algebra and V_λ be the irreducible g-module
with highest weight λ. Can sage compute the formal character
ch(V_λ)=∑_μdim(V_μ)e(μ) explicitly? Thank you very much.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send em
Dear Maarten,
Thank you very much for your effort. I use Google Chrome and 'tab' key is
not working.
Thank you again.
With regards,
Santanu
On 26 August 2011 03:22, Maarten Derickx wrote:
> Dear Santanu,
>
> I noticed that you asked quite a few "easy" questions in the last few day.
> It might
sage: mod(452,60), mod(452,90), mod(452,150)
(32, 2, 2)
But
sage: CRT([32,2,2],[60,90,150])
Traceback (click to the left of this block for traceback)
...
ValueError: No solution to crt problem since gcd(5400,150) does not
divide 92-2
It looks like a bug to me, isn't it? At least SAGE shouldn't
23 matches
Mail list logo
