hi,
i m working on some applications of Galois Field polynomials using sympy.
(Mostly for illustration purposes).
Is there a place for those in sympy code base?
regards,
kasun
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, sen
;> Use more descriptive messages than "Invalid Argument" for your errors.
> >> For example, for this one, you might use "Argument of PrimeField must
> be a
> >> prime number (received 4)", or something similar.
> >> In [22]: a
> >> Out[
lsewhere, use one space around an =, such as "gf7 =
> PrimeField(7)".
>
> I think this is almost ready.
>
> Aaron Meurer
> On Apr 16, 2010, at 4:29 PM, Kasun Samarasinghe wrote:
>
> hi aaron,
>
> i managed to fix the doctest problem, here is the patch for tha
hi,
I created a github account and a repository there. Then I added a remote
repository using
git remote add finitefield g...@github.com:k
wsamarasin...@gmail.com/sympy_finitefields
but when I trying to push my new branch to the git repository an error
occurs.
error is permission denied (public
Yes, but i m not sure about the solution?
On Sun, Apr 18, 2010 at 3:21 PM, David Joyner wrote:
> On Sun, Apr 18, 2010 at 8:57 AM, Kasun Samarasinghe
> wrote:
> > hi,
> > i m using igcdex for prime field multiplication inverse calculation. when
> i
> > call igcdex
>
hi,
i m using igcdex for prime field multiplication inverse calculation. when i
call igcdex
for (2,3) (which is in my case multiplicative inverse of 2 mod 3) returns
-1, which is not correct
for multiplicaitve inverse calculation. (even though igcdex it self is
correct and returns right values)
hi aaron,
i managed to fix the doctest problem, here is the patch for that part only.
kasun
On Sat, Apr 17, 2010 at 12:12 AM, Kasun Samarasinghe <
kwsamarasin...@gmail.com> wrote:
> I have fixed the nested problem and white spaces problem. In my machine it
> passes the tests.
>
I have fixed the nested problem and white spaces problem. In my machine it
passes the tests.
here __init__.patch is the import statement in sympy/__init__.py
thank you,
kasun
On Fri, Apr 16, 2010 at 11:27 PM, Kasun Samarasinghe <
kwsamarasin...@gmail.com> wrote:
> also can you plea
also can you please have a look at my doctests, since it fails.
thanks
On Fri, Apr 16, 2010 at 11:20 PM, Kasun Samarasinghe <
kwsamarasin...@gmail.com> wrote:
> hi aaron
>
> will it convert the tab into four spaces if I run the strip utility?
>
> thanks
> kasun
>
>
e 82, in test
> assert False, message_tabs % (fname, idx+1)
> AssertionError: File contains tabs instead of spaces:
> /users/aaronmeurer/documents/python/sympy/sympy/sympy/abstractalgebra/abstractalgebra/finitefield.py,
> line 11.
>
> Aaron Meurer
> On Apr 15, 2010, at 5:49 PM
hi aaron,
I managed to make it passed test, please give me the comment. attached the
patch with this
thank you
kasun
On Fri, Apr 16, 2010 at 12:31 AM, Ronan Lamy wrote:
> Le jeudi 15 avril 2010 à 13:46 -0600, Aaron S. Meurer a écrit :
> > - I think PrimeField should subclass from Expr or Basic
y file.
>
> Aaron Meurer
> On Apr 15, 2010, at 4:10 PM, Kasun Samarasinghe wrote:
>
> i m having a problem with tests. When I run the test I get the intended
> results from another python file. but when i run bin/test it fails? what can
> be the possible reason. Also I get the error
, Apr 15, 2010 at 11:29 PM, Kasun Samarasinghe <
kwsamarasin...@gmail.com> wrote:
> hi aaron
>
> yes this is only the first part as a starting point. GF(p**n) will be
> implemented later.
> On sub classing, I think this is a standalone module, since its a different
> algebrai
t it.
> - What about GF(p**n), where p is prime and n is an integer? Does this
> require more work to implement than just GF(p) (or is it just forthcoming)?
>
> Aaron Meurer
> On Apr 15, 2010, at 2:39 PM, Kasun Samarasinghe wrote:
>
> > I changed according to the commen
I changed according to the comments. Please have a look,
kasun
On Thu, Apr 15, 2010 at 9:55 PM, Kasun Samarasinghe <
kwsamarasin...@gmail.com> wrote:
> hi,
>
> this is just the prime field implementation, which just provides the prime
> field arithmetic and operations. There
point:
> - How is this different from the GF implementation in polys? Should this
> rather just be providing a user interface to that?
>
> Aaron Meurer
>
> On Apr 15, 2010, at 12:34 PM, Kasun Samarasinghe wrote:
>
> > Hi,
> >
> > I tried to implement Prime
Hi,
I tried to implement Prime Fields which is the first part of my GSOC
project. I attached the patch with
this. Please review it and comment.
Thnak you,
kasun
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sy.
hi
i added a package and files under it in sympy source repository. How can I
patch the changes?
kasun
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sy...@googlegroups.com.
To unsubscribe from this group, send e
hi,
In sympy number's module (sympy.core.numbers) extended gcd algorithm
performs over normal
arithmetic. Is there an implementation of it over modulo arithmetic in
sympy?
which means to find x and y such that a*x+b*y=gcd(a,b) modulo n?
regards,
kasun
--
You received this message because you ar
hi,
i m searching for some open issues. While I m searching in the issue
list, I would like to work on issues in galois polynomials if there
are any. Please point me some I can work on.
regards,
kasun
On 4/13/10, Ondrej Certik wrote:
> Hi GSoC students,
>
> the next step that is required now f
wrote:
> On Mon, Apr 5, 2010 at 4:24 PM, Kasun Samarasinghe
> wrote:
> > Hi,
> >
> > this is an outline of the first idea i m working on gsoc. Coding theory
> part
> > is not yet worked out, for that I need some guidance from david. Please
> give
> > me
th has done this
> http://nzmath.sourceforge.net/wiki/?finitefield.py/ExtendedField
> Anyway, what you have sounds fine so far.
>
> On Sat, Apr 3, 2010 at 2:02 PM, Kasun Samarasinghe
> wrote:
> > hi,
> >
> ...
> >
> > In the finite field implementation, I thought of these steps,
but can we spedify the degree in that?
On Mon, Apr 5, 2010 at 12:38 AM, Mateusz Paprocki wrote:
> Hi,
>
> On Mon, Apr 05, 2010 at 12:27:38AM +0200, Kasun Samarasinghe wrote:
> > hi,
> >
> > Is there a function in sympy to construct an irreducible polynomial ove
hi,
Is there a function in sympy to construct an irreducible polynomial over a
finite field of a
given degree?
thank you
kasun
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sy...@googlegroups.com.
To unsubscribe
Apr 2, 2010 at 10:35 AM, Kasun Samarasinghe
> wrote:
> > hi david,
> >
> > can you please give me a reference to forward and reverse cyclic
> > matrix constructions.
> > I m a bit confused about it? please give me some reference to look into
>
>
> http://
hi david,
can you please give me a reference to forward and reverse cyclic
matrix constructions.
I m a bit confused about it? please give me some reference to look into
regards,
kasun
On 4/1/10, David Joyner wrote:
> On Thu, Apr 1, 2010 at 10:53 AM, Kasun Samarasinghe
> wrote:
>&g
i started working on the preliminary work. I will update you. I also not
sure about how mentoring process works.
kasun
On Thu, Apr 1, 2010 at 10:28 PM, Vinzent Steinberg <
vinzent.steinb...@googlemail.com> wrote:
> On Apr 1, 11:08 am, Kasun Samarasinghe
> wrote:
> > hi,
&g
se anyone implementing that.
> So at least I don't think your previous suggestion is a bad idea at all.
>
> On Thu, Apr 1, 2010 at 5:08 AM, Kasun Samarasinghe
> wrote:
> > hi,
> >
> > It seems the above suggestion I made in the previous mail is not that
> > int
an important contribution?
regards,
Kasun
On Mon, Mar 29, 2010 at 11:21 AM, Kasun Samarasinghe <
kwsamarasin...@gmail.com> wrote:
> hI,
>
> I m interested in implementing finite fields separately for SymPy.
> Currently there is no separate finite field implementation and g
hI,
I m interested in implementing finite fields separately for SymPy. Currently
there is no separate finite field implementation and galois polynomial
manipulations does it internally. But
with a separate finite field implementation there can be several other
implementations over it. For example
hi,
hope u havent seen my last mail about the irreduciblity algorithm problem,
please have a look on that so that i can complete the my patch and send for
the review,
regards,
kasun
On Sat, Mar 13, 2010 at 10:44 AM, Kasun Samarasinghe <
kwsamarasin...@gmail.com> wrote:
> hi,
>
:
return False
am i doing anything wrong here?
regards,
kasun
On Tue, Mar 9, 2010 at 8:52 PM, Mateusz Paprocki wrote:
> Hi,
>
> On Tue, Mar 09, 2010 at 08:36:18PM +0100, Kasun Samarasinghe wrote:
> > Hi,
> >
> > I m working on the comments, I think i can f
ank you,
Kasun
On Tue, Mar 9, 2010 at 1:07 PM, Mateusz Paprocki wrote:
> Hi,
>
> On Sun, Mar 07, 2010 at 02:07:29PM +0100, Kasun Samarasinghe wrote:
> > hi,
> > I have attached the patch with this for rabin's test for irreducibility
> > test. Please give me
i figured out the way. I will send the patch for review.
kasun
On Tue, Mar 9, 2010 at 9:02 PM, Kasun Samarasinghe wrote:
> but i need to check the gcd for all ni, where ni=n/pi. here pi are the
> prime factors of n. So
> i have to call gf_pow for all such numbers. what can i do in
> On Tue, Mar 9, 2010 at 1:07 PM, Mateusz Paprocki
> wrote:
> >
> > > Hi,
> > >
> > > On Sun, Mar 07, 2010 at 02:07:29PM +0100, Kasun Samarasinghe wrote:
> > > > hi,
> > > > I have attached the patch with this for rabin's test for
= {6,4}. Is it because it raises to a large power or is it a
problem with my code.
Kasun
On Tue, Mar 9, 2010 at 1:07 PM, Mateusz Paprocki wrote:
> Hi,
>
> On Sun, Mar 07, 2010 at 02:07:29PM +0100, Kasun Samarasinghe wrote:
> > hi,
> > I have attached the patch with this
:
>
> On Mar 8, 2010, at 4:33 AM, Priit Laes wrote:
>
> > Ühel kenal päeval, P, 2010-03-07 kell 14:07, kirjutas Kasun
> > Samarasinghe:
> >> hi,
> >> I have attached the patch with this for rabin's test for
> >> irreducibility test
, P, 2010-03-07 kell 14:07, kirjutas Kasun
> Samarasinghe:
> > hi,
> > I have attached the patch with this for rabin's test for
> > irreducibility test. Please give me some comments on that.
>
> > +def gf_irreducible_rabin(f, p, K):
> > +""&quo
hi,
I have attached the patch with this for rabin's test for irreducibility
test. Please give me some comments on that.
Kasun
On Sat, Mar 6, 2010 at 8:32 AM, Ondrej Certik wrote:
> On Fri, Mar 5, 2010 at 3:00 PM, Kasun Samarasinghe
> wrote:
> > hi,
> > how can i patch
hi,
how can i patch the modification i done using git?
kasun
On Tue, Mar 2, 2010 at 11:20 PM, Ondrej Certik wrote:
> On Tue, Mar 2, 2010 at 2:10 PM, Kasun Samarasinghe
> wrote:
> > Hi,
> > I have implemented the rabis's irreducibility test in galois tool. How
> ca
Hi,
I have implemented the rabis's irreducibility test in galois tool. How can I
send it to you all
to get comments.
Regards
Kasun
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sy...@googlegroups.com.
To unsubsc
i think i have taken it wrong. Both of them are the same and i can use
factorint()
kasun
On Thu, Feb 18, 2010 at 1:43 AM, Kasun Samarasinghe <
kwsamarasin...@gmail.com> wrote:
> thnak you Aaron. isnt factorint() is to get the prime factors of a given
> number. But I want
> get th
thnak you Aaron. isnt factorint() is to get the prime factors of a given
number. But I want
get the divisors of a number which are prime?
Kasun
On Thu, Feb 18, 2010 at 1:37 AM, Aaron S. Meurer wrote:
> factorint()
>
> Aaron Meurer
> On Feb 17, 2010, at 5:32 PM, Kasun Samara
Hi,
is there a function in sympy number theory to get the prime divisors of a
given number, other than
taking the divisors and checking for primality?
Thank you,
Kasun
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email
Thank you. I think it is a pydev error.
Kasun
On Wed, Feb 10, 2010 at 8:41 PM, Ondrej Certik wrote:
> On Wed, Feb 10, 2010 at 11:38 AM, Kasun Samarasinghe
> wrote:
> > Hi,
> >
> > I m in windows and trying to import the sympy source to eclipse's pydev
&g
Hi,
I m in windows and trying to import the sympy source to eclipse's pydev
plugin. I get
errors as "Duplicated signature" for many methods. eclipse uses python 2.6.
Sympy version is
a newest check out. What can I do for this?
Kasun
--
You received this message because you are subscribed to the
That is interesting I worked with web services before, specially with apache
axis and apache synapse. I can git it a try
Kasun
On Wed, Feb 10, 2010 at 7:52 PM, Ondrej Certik wrote:
> On Wed, Jan 27, 2010 at 2:39 PM, Ondrej Certik wrote:
> > On Wed, Jan 27, 2010 at 2:37 PM, Kasun Sam
= 1
> (mod p)
>
> Note that when you have n == 1, then it is just x**p - x.
>
> I can summarize the proof from the text if you are interested.
>
> Aaron Meurer
> On Feb 7, 2010, at 3:51 PM, Kasun Samarasinghe wrote:
>
> Hi,
>
> Could you please explain the basis
Hi,
Could you please explain the basis for the implemented irreducibility test.
Is it
polynomial overr GF(p) is reducible if gcd(f, x^p - x (mod p)) = 1?
Regards,
Kasun
On Wed, Feb 3, 2010 at 3:56 PM, Mateusz Paprocki wrote:
> Hi,
>
> On Wed, Feb 03, 2010 at 02:06:10AM +01
polys5
> git checkout -b polys5
>
> Then you can just to git pull on that branch to update it, and repeat the
> above 3 for new branches.
>
> Hope that helps.
>
> Aaron Meurer
>
> On Feb 3, 2010, at 2:08 PM, Kasun Samarasinghe wrote:
>
> But it does not checks out t
But it does not checks out the new files in
http://github.com/mattpap/sympy-polys/tree/polys5/sympy/polys/.
Kasun
On Wed, Feb 3, 2010 at 10:05 PM, Aaron S. Meurer wrote:
> I believe it is git://github.com/mattpap/sympy-polys.git
>
> Aaron Meurer
> On Feb 3, 2010, at 1:55 PM, Kasun
HI,
I was trying to checkout the poly5 branch using git. what is the url should
use?
i mean in git clone "?".
Kasun
On Wed, Feb 3, 2010 at 3:56 PM, Mateusz Paprocki wrote:
> Hi,
>
> On Wed, Feb 03, 2010 at 02:06:10AM +0100, Kasun Samarasinghe wrote:
> > Hi all,
>
Hi all,
When I examining the galoisplynomail source code I found that irreducibility
test is not implemented.
Is there any special reason? As I read there are several algorithms for that
and Rabin's irreducibility test
is an interesting one. Can we implement that in sympy?
Regards,
Kasun
--
You
is some finite field stuff
> internally in the Polys module. See the Galois_Polys file, and also the new
> module (issue 1598).
>
> Aaron Meurer
> On Jan 29, 2010, at 5:46 PM, Kasun Samarasinghe wrote:
>
> Thank you. So I will start with your steps. Update you on the progress
Thank you. So I will start with your steps. Update you on the progress
Kasun
On Sat, Jan 30, 2010 at 1:41 AM, David Joyner wrote:
> On Fri, Jan 29, 2010 at 7:34 PM, Kasun Samarasinghe
> wrote:
> > No, I ment a project idea where i can work with Sympy with regard to
> co
No, I ment a project idea where i can work with Sympy with regard to coding
theory?
On Sat, Jan 30, 2010 at 1:25 AM, David Joyner wrote:
> On Fri, Jan 29, 2010 at 5:17 PM, Kasun Samarasinghe
> wrote:
> > david,
> >
> > I m looking out and reading several ideas the
david,
I m looking out and reading several ideas these days. Do you have any idea
related to Coding where I can start working on?
regards,
Kasun
On Thu, Jan 28, 2010 at 9:38 PM, Ondrej Certik wrote:
> On Thu, Jan 28, 2010 at 12:23 PM, Vinzent Steinberg
> wrote:
> > Tensors could be also a gre
wnload the source and play around with
> it, seeing what sorts of things are not implemented yet, or not implemented
> well.
>
> What are you studying at KTH, by the way?
>
> Aaron Meurer
> On Jan 27, 2010, at 3:37 PM, Kasun Samarasinghe wrote:
>
> Hi,
>
> I m Ka
related to coding theory since I have some background in it
as well.
Regards,
Kasun
On Wed, Jan 27, 2010 at 11:39 PM, Ondrej Certik wrote:
> On Wed, Jan 27, 2010 at 2:37 PM, Kasun Samarasinghe
> wrote:
> > Hi,
> >
> > I m Kasun, a master student at KTH Sweden. I m also
Hi,
I m Kasun, a master student at KTH Sweden. I m also interested in applying
for a GSoc. Will the possible project ideas on sympy be posted?
Regards,
Kasun
On Wed, Jan 27, 2010 at 11:25 PM, Aaron S. Meurer wrote:
> I made a wiki page, which is mostly a copy of last years page, here:
> http://
Thank you for the reply. Actually I was solving a problem where i need to
integrate from
minus infinity to plus infinity. Can I do that in the way you mentioned?
Kasun
On Sun, Jan 10, 2010 at 3:32 PM, Ondrej Certik wrote:
> On Sun, Jan 10, 2010 at 6:07 AM, Kasun Samarasinghe
> wrote:
Hi all,
Is there a way we can evaluate infinite integrals in SymPy?
Kasun
--
You received this message because you are subscribed to the Google Groups "sympy" group.
To post to this group, send email to sy...@googlegroups.com.
To unsubscribe from this group, send email to sympy+unsubscr...@go
62 matches
Mail list logo
