OK, I've sent it to Google. If you want to make any changes, make
them soon (I just sent the link)!
I'll let you know when it's been posted.
Aaron Meurer
On Tue, Jan 8, 2013 at 4:08 AM, Aleksandar Makelov
wrote:
> Hi, sorry for getting back to you that late, just wanted to say that I'm
> very
Hi, sorry for getting back to you that late, just wanted to say that I'm
very happy with the description of my GSoC project, it's concise and to the
point. Thanks guys!
On Wednesday, January 2, 2013 5:23:29 PM UTC+2, Sergiu Ivanov wrote:
>
> Hello,
>
> I have just finished the beta-draft of our
I have updated my blog with new versions of my Android applications (Obliq
for Android and Cinematics for Android) written with SL4A using
HTML+CSS+JavaScript GUI.
http://py-obliq.blogspot.com.br/
Em 6 de abril de 2012 11:31, Flávio Manoel S. Hemerli <
bard.boto...@gmail.com> escreveu:
> My pu
My pull request: https://github.com/sympy/sympy/pull/1217
Em 6 de abril de 2012 03:41, Flávio Manoel S. Hemerli <
bard.boto...@gmail.com> escreveu:
> Sorry Jorge, I forgot to thank you.
>
> Em 6 de abril de 2012 03:29, Flávio Manoel S. Hemerli <
> bard.boto...@gmail.com> escreveu:
>
> I have just
Sorry Jorge, I forgot to thank you.
Em 6 de abril de 2012 03:29, Flávio Manoel S. Hemerli <
bard.boto...@gmail.com> escreveu:
> I have just submitted a pull request for my fix to the #3206 issue:
> https://github.com/sympy/sympy/pull/1214
>
> 2012/4/5 Flávio Manoel S. Hemerli :
>> > Hello everyon
I have just submitted a pull request for my fix to the #3206 issue:
https://github.com/sympy/sympy/pull/1214
2012/4/5 Flávio Manoel S. Hemerli :
> > Hello everyone,
> >
> > I need only to submit a patch to finish my application and I need some
> help.
> > I have fixed the issue 3206 (about Abs(Abs
Here is sympy repo: https://github.com/sympy/sympy you can create your
own repo on the top right button, and you need to work on this new
repo.
In the view of your fork, you will see a button "Pull Request".
On Thu, Apr 5, 2012 at 8:47 PM, Jorge Cardona wrote:
> You will need a github account, c
You will need a github account, create a fork from sympy repo, push
your code to your own repo, and then make a pull request to sympy
repo.
2012/4/5 Flávio Manoel S. Hemerli :
> Hello everyone,
>
> I need only to submit a patch to finish my application and I need some help.
> I have fixed the issu
Hello everyone,
I need only to submit a patch to finish my application and I need some help.
I have fixed the issue 3206 (about Abs(Abs(x)) return Abs(Abs(x)) insted of
Abs(x)) but I'm really new to git and github and don't know how to submit,
can you guys lend me a hand to finish it? I don't have
I have sent my GSoC application early today: SymPy Interface for Android (
https://github.com/sympy/sympy/wiki/GSoC-2012-Application:---Flavio-Manoel-S-Hemerli,-SymPy-GUI-for-Android
).
I'm open to suggestions, discussions, etc.
Em 3 de abril de 2012 15:27, Flávio Manoel S. Hemerli <
bard.boto..
Em 3 de abril de 2012 10:12, Flávio Manoel S. Hemerli <
bard.boto...@gmail.com> escreveu:
> Hello everyone,
>
> My name is Flavio Manoel S. Hemerli and I'm a Brazilian physics student in
> the Federal University of Espirito Santo (UFES).
>
> I have experience with Python, Pascal, C/C++ and RGSS (R
Gsoc Proposal :
https://github.com/sympy/sympy/wiki/GSoC-2012-Application:Sachin-Irukula-:-Implementation-of-Quantifiers-and-Cylindrical-algebraic-decomposition-algorithm
>
> Regards
>
> Sachin Irukula
>
--
You received this message because you are subscribed to the Google Groups
"sympy" gro
Hi,
Thanks for the suggestions. I have tried to apply your feedback in the
proposal and now it's like this-
https://github.com/sympy/sympy/wiki/GSOC-2012-implementing-algorithm-to-find-the-limits-of-series
Any more suggestions please
Regards,
-Saurabh Jha
On Apr 2, 12:53 am, Tom Bachmann wro
Hi everyone,
I would like to know which algorithm would be better for checking the
satisfiability of first order logic expressions, I went through simplify
theorem prover which seems to be good, and also is there any potential
mentor for this area(logic module).
--
You received this messag
On Sun, Apr 1, 2012 at 7:04 AM, Tom Bachmann wrote:
>> Is GF(8) implemented in SymPy?
>>
>
> You can type GF(8), but I think this yields ZZ/8ZZ.
>
Yes, in 0.7.1, I get this:
>>> F = GF(8)
>>> F(7)
7 mod 8
>
> --
> You received this message because you are subscribed to the Google Groups
> "sym
Is GF(8) implemented in SymPy?
You can type GF(8), but I think this yields ZZ/8ZZ.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from this group, send email to
sympy+unsu
On Sat, Mar 31, 2012 at 10:40 PM, Aleksandar Makelov
wrote:
> On a similar note, I'm now implementing a tiny project to handle
> character tables by manual input from the user.
> This was *motivated* by a recent problem set in which one of the
> problems was about decomposing 4 representations of
On Sat, Mar 31, 2012 at 10:26 PM, Aleksandar Makelov
wrote:
> Oh I was being foolish... Of course, simplicity will require some more
> substantial algorithms. What I had in my head when I was writing this
> was only giving the group object various properties with names like
> isFinite, isAbelian,.
On a similar note, I'm now implementing a tiny project to handle
character tables by manual input from the user.
This was *motivated* by a recent problem set in which one of the
problems was about decomposing 4 representations of S4 into
irreducible ones, which takes about 300 multiplications and 1
Oh I was being foolish... Of course, simplicity will require some more
substantial algorithms. What I had in my head when I was writing this
was only giving the group object various properties with names like
isFinite, isAbelian,... that would later be used (and indeed,
evaluated and stored in the
On Sat, Mar 31, 2012 at 9:10 PM, Aleksandar Makelov
wrote:
> Hi David,
>
> and thanks a lot for the feedback! I don't find it critical at all - I
> find it helpful because it helps me to see this project from a new
> perspective.
>
> On Mar 31, 4:18 pm, David Joyner wrote:
>
>> In general, I find
On Mar 30, 2:31 am, Tom Bachmann wrote:
> Hi,
>
> as you say, a couple of important things are missing (or implicit in the
> timeline): What algorithms do you intend do implement? What data
> structures/classes will you implement to support this? Somewhat less
> importantly in this case of rathe
Hi David,
and thanks a lot for the feedback! I don't find it critical at all - I
find it helpful because it helps me to see this project from a new
perspective.
On Mar 31, 4:18 pm, David Joyner wrote:
> In general, I find it hard to comment on this proposal without knowing
> how much group theo
On Sat, Mar 31, 2012 at 12:53 PM, Tom Bachmann wrote:
> I somehow feel like I have to explain myself (maybe because Mateusz is not
> coming to my rescue in defending his design). The following statements are
> true:
>
> - Had I written the polys module, there would be no C-like "functional"
> int
I somehow feel like I have to explain myself (maybe because Mateusz is
not coming to my rescue in defending his design). The following
statements are true:
- Had I written the polys module, there would be no C-like "functional"
interfaces. There would be very few global functions (all in obje
On Fri, Mar 30, 2012 at 2:22 PM, Ronan Lamy wrote:
> Le vendredi 30 mars 2012 à 22:15 +0300, Sergiu Ivanov a écrit :
>> Hello,
>>
>> I will answer to a comment by Tom here, partly because it's more
>> comfortable for me to write E-mails. Should anyone feel this switch
>> is wrong, we can always t
Le vendredi 30 mars 2012 à 22:15 +0300, Sergiu Ivanov a écrit :
> Hello,
>
> I will answer to a comment by Tom here, partly because it's more
> comfortable for me to write E-mails. Should anyone feel this switch
> is wrong, we can always turn back to discussing on Melange.
>
> Tom Bachmann March
On Fri, Mar 30, 2012 at 3:07 AM, Sergiu Ivanov
wrote:
> On Fri, Mar 30, 2012 at 4:59 AM, Ronan Lamy wrote:
>>
>> This looks like it'll be a solid proposal. In particular, you do a good
>> job of summarising the feasibility of your project, its evaluation
>> criteria and the benefits it would brin
Le mercredi 28 mars 2012 à 22:05 -0700, sachin004 a écrit :
> Ok, If we are calling expr as cond then what shall we call condition
> as.
If you have two parameters with the same name, it's a sign that there's
a problem with your design. Either the parameters should be combined or
their meaning sho
symbolic regression (or symbolic function identification)can be done by
genetic programming (many other methods are available ). symbolic
regression finds the symbolic expression function to the given data input
and outputs and outputs an expression best fitted for the inputs. the basic
differe
On Fri, Mar 30, 2012 at 4:59 AM, Ronan Lamy wrote:
>
> This looks like it'll be a solid proposal. In particular, you do a good
> job of summarising the feasibility of your project, its evaluation
> criteria and the benefits it would bring. However, some points
> (particularly the section "Infrastr
Le vendredi 30 mars 2012 à 02:35 +0300, Sergiu Ivanov a écrit :
> Hello,
>
> This is the draft of my proposal about Groebner walk:
>
>
> https://github.com/sympy/sympy/wiki/GSoC-2012-Application-Sergiu-Ivanov:-Generic-Gr%C3%B6bner-Walk
>
> I'd be very happy to hear some feedback :-)
>
> Serg
Hello,
This is the draft of my proposal about Groebner walk:
https://github.com/sympy/sympy/wiki/GSoC-2012-Application-Sergiu-Ivanov:-Generic-Gr%C3%B6bner-Walk
I'd be very happy to hear some feedback :-)
Sergiu
--
You received this message because you are subscribed to the Google Groups
"
Thanks a bunch! I'll take a look.
Alex
On Mar 28, 3:03 pm, David Joyner wrote:
> I wrote this 3 days ago and somehow put it in drafts instead of
> sending it. Hope it still helps.
>
> On Sat, Mar 24, 2012 at 10:53 PM, Aleksandar Makelov
>
>
>
>
>
>
>
>
>
> wrote:
>
> > On Mar 24, 10:39 pm, Aaro
Any more suggestions/topics that i can add to this idea.
Regards
Sachin
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/sympy/-/ss8h8ek2yGMJ.
To post to this group, send email
Ok, If we are calling expr as cond then what shall we call condition as.
Regards
Sachin
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/sympy/-/656q-yU9MrAJ.
To post to this gro
I think you always need the condition. Just saying "for all x"
doesn't make any sense. You have to have "for all x in some set".
By the way, it's just a semantics things, but expr should really be
called cond, since it needs to be a boolean condition, not just some
generic expression.
Aaron Meu
Implementation of universal quantifiers
Universal Quantification: Function: for_all(expr,variables,condition)
· ∀ xexpr which says that expr holds for all values of x for this the
function looks like for_all(expr,var) where var=Tuple(x)
this returns an assertion based on the expr and
Universal Quantification: Function: for_all(expr,variables,condition)
·[image: http://reference.wolfram.com/chars/ForAll.gif]xexpr which
says that expr holds for all values of x for this the function looks like
for_all(expr,var) where var=Tuple(x)
this returns an assertion based on
I wrote this 3 days ago and somehow put it in drafts instead of
sending it. Hope it still helps.
On Sat, Mar 24, 2012 at 10:53 PM, Aleksandar Makelov
wrote:
>
>
> On Mar 24, 10:39 pm, Aaron Meurer wrote:
>
>> How could it be too late?
>>
>>
>
> Well yeah I hoped it's not :) I was wondering about
4.Refactoring old handlers in assumptions.
Partial work has already been started.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/sympy/-/WmuM9Rlzcv8J.
To post to this
sorry for that I didn't realize that it's already been implemented
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/sympy/-/tn34pfZh-eAJ.
To post to this group, send email to sy
and i would like to add
implementing de Moivre's formula to my ideas list.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/sympy/-/Npa_6wRA32sJ.
To post to this group, send emai
ok, but how can i know whether there is any suitable mentor for this topic
or the other topics that i have mentioned in my previous post ? As I have
less time and with current mid term examinations for me its bit difficult
if i don't finalize on my project proposal.
Regards
sachin
--
You rec
Le mardi 27 mars 2012 à 10:57 -0700, sachin004 a écrit :
> does it mean symbolic regression doesn't come under a project for
> sympy gsoc
I don't know. It doesn't seem farther from sympy's core goals than the
Live/Gamma or Android projects. The difficulty is in knowing the
dependency requirements
does it mean symbolic regression doesn't come under a project for sympy gsoc
Regards
Sachin
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/sympy/-/ClHA_6E0oPEJ.
To post to this
Le mardi 27 mars 2012 à 09:43 -0700, sachin004 a écrit :
> symbolic regression (or symbolic function identification)can be done
> by genetic programming (many other methods are available ). symbolic
> regression finds the symbolic expression function to the given data
> input and outputs and output
symbolic regression (or symbolic function identification)can be done by
genetic programming (many other methods are available ). symbolic
regression finds the symbolic expression function to the given data input
and outputs and outputs an expression best fitted for the inputs. the basic
differe
On Tue, Mar 27, 2012 at 8:42 AM, sachin004 wrote:
> Hii matthew,
>
> Firstly thanks for the suggestions.
> I have suggested linear regression just as a stepping stone to symbolic
> regression. Even though both are different in many ways what i would like to
> suggest is that sympy to support symbo
just to make a note matlab and mathematica and others included linear
regression in their symbolic tool box.
I am sorry if am wrong in any information, if any please correct me.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To view this discussion
Hii matthew,
Firstly thanks for the suggestions.
I have suggested linear regression just as a stepping stone to symbolic
regression. Even though both are different in many ways what i would like
to suggest is that sympy to support symbolic regression (which I thought of
including based on the r
Hi Sachin,
I'm not knowledgable about SymPy's logic system although there has been
some discussion of this topic on this listhost recently. I would perform a
search on the mailing list to find the recent e-mail conversations. I think
that there is some work to do here but I don't know any more.
Hi everyone,
Any suggestions
On Monday, March 26, 2012 8:29:46 PM UTC+5:30, sachin004 wrote:
>
> Hi,
>
> Introduction: I am currently a third year computer science undergraduate
> from Bits-Pilani , and I would like to participate in sympy development in
> GSCOC 2012.
>
> Experience: I have b
Hi,
I read this algorithm from a calculus textbook "Thomas' Calculus 12th
Edition". It's in chapter 5, Integration.
-Saurabh Jha
On Mar 27, 12:55 am, someone wrote:
> Hi,
>
> > Can you provide a reference for this algorithm? I'm not familiar
> > with it.
>
> As far as I could find out in my se
On Sun, Mar 25, 2012 at 8:31 PM, Sergiu Ivanov
wrote:
>
> [0]
> https://github.com/sympy/sympy/wiki/GSoC-2012:-Application-by-Sergiu-Ivanov:-Implementing-Generic-Gr%C3%B6bner-Walk
Sorry, I failed to pay attention to the proper page naming convention :-(
https://github.com/sympy/sympy/wiki/GSoC-
On Sat, Mar 24, 2012 at 8:53 PM, Aleksandar Makelov
wrote:
>
>
> On Mar 24, 10:39 pm, Aaron Meurer wrote:
>
>> How could it be too late?
>>
>>
>
> Well yeah I hoped it's not :) I was wondering about that because it'd
> take a massive amount of changes over different modules to put all
> abstract
On Mar 24, 10:39 pm, Aaron Meurer wrote:
> How could it be too late?
>
>
Well yeah I hoped it's not :) I was wondering about that because it'd
take a massive amount of changes over different modules to put all
abstract algebraic structures on a common setting -- but I think
that's the right di
On Sat, Mar 24, 2012 at 8:26 PM, Aleksandar Makelov
wrote:
> Yep so I installed GAP and started reading through the manual. Indeed,
> it seems that the finite groups - permutation groups, matrix groups,
> polycyclic groups - are almost always realized as permutation groups
> (for matrix groups the
Yep so I installed GAP and started reading through the manual. Indeed,
it seems that the finite groups - permutation groups, matrix groups,
polycyclic groups - are almost always realized as permutation groups
(for matrix groups there is a 'canonical' way to do this via a
faithful permutation repres
Its a Linux user group in my undergrad school consisting of some
pretty smart hackers. These guys hack on Git, virtual machines (Mono,
LLVM, Jato), kernel, haskell, algebra systems (:
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this grou
On Sat, Mar 24, 2012 at 10:02 AM, Saptarshi Mandal
wrote:
>>
>> > Idea 1:
>> > I looked at the project ideas, and the project on Series expansions which
>> > seems interesting to me. I have looked closely at the 32 series defects and
>> > was wondering what parts of the code might be relevant to
>
> > Idea 1:
> > I looked at the project ideas, and the project on Series expansions which
> > seems interesting to me. I have looked closely at the 32 series defects and
> > was wondering what parts of the code might be relevant to look at, and any
> > prior work there may have been on this or w
Hi,
Since the earlier idea(Symbolic Computation of integral by recurrence)
is not enough for a whole GSoC project, I went through the idea list
once again, and focused on "Series Expansions". I then went through
the link "current situation", but was unable to figure out whether the
implementation o
Hi,
> > I went through the paper "Symbolic summation with radical
> > expression" and I found myself unable to understand many points due
> > to my insufficient mathematical background
The whole topic of symbolic summation requires a
very strong background on (abstract) algebra. That's
one reason
On Fri, Mar 23, 2012 at 10:55 PM, Saurabh Jha wrote:
>
> I went through the paper "Symbolic summation with radical expression"
> and I found myself unable to understand many points due to my
> insufficient mathematical background which is summarized below:
>
> 1. Calculus(Single and Multivariable)
I went through the paper "Symbolic summation with radical expression"
and I found myself unable to understand many points due to my
insufficient mathematical background which is summarized below:
1. Calculus(Single and Multivariable)
2. Coordinate Geometry
3. Sequences Series (General properties o
On Fri, Mar 23, 2012 at 10:23 AM, Shubhankit Mohan wrote:
> Hello,
>
> I am Shubhankit Mohan, a 4th year engineering undergraduate student at IIT
> Kharagpur.Being honest I am new to Open Source Development and I have never
> worked on any open source project before.I liked Sympy as I have immense
Am 23.03.2012 06:23, schrieb Rishav Das:
I can see you're right.
No harm done, that's what code review is for :-)
Can you close the pull request? Otherwise, it will stay around as "open,
needs to be merged into the project" until somebody comes around to
pulling it (and we'll have the same
Hi.
On Thu, Mar 22, 2012 at 10:53 PM, Shubhankit Mohan
wrote:
> Hello,
>
> I am Shubhankit Mohan, a 4th year engineering undergraduate student at IIT
> Kharagpur.Being honest I am new to Open Source Development and I have never
> worked on any open source project before.I liked Sympy as I have im
On Mar 22, 2:32 am, Joachim Durchholz wrote:
> Am 21.03.2012 15:41, schrieb Rishav Das:
>
> > Xnor(True,True,True) = False
>
> NOT (True XOR True XOR True)
>
> isn't how operators are commonly extended to multiple operands.
> The common definition would be
>
> True XNOR True XNOR True
>
> which
Well, one difference could be that it doesn't actually store the whole
permutation when it's not necessary. This could be useful for groups
of very large order.
For example, the other day, I was trying to figure out a way to
generate a random permutation of order roughly 2**32 (what I was
trying
Am 21.03.2012 15:41, schrieb Rishav Das:
Xnor(True,True,True) = False
NOT (True XOR True XOR True)
isn't how operators are commonly extended to multiple operands.
The common definition would be
True XNOR True XNOR True
which evaluates to True.
whereas Equivalent(True, True, True) = True
Xnor(True,True,True) = False
whereas Equivalent(True, True, True) = True
One example of how they differ.
On Mar 21, 10:36 am, Joachim Durchholz wrote:
> Am 21.03.2012 15:26, schrieb Rishav Das:
>
> > Xnor is defined for multiple inputs while logical equivalence is
> > defined only for two inputs
Am 21.03.2012 15:26, schrieb Rishav Das:
Xnor is defined for multiple inputs while logical equivalence is
defined only for two inputs.
Equivalent as defined in SymPy can handle multiple inputs, see the
doctests on Equivalent.eval.
It seems we have a somewhat too narrow class docstring on Equ
Xnor is defined for multiple inputs while logical equivalence is
defined only for two inputs.
(Interestingly, the two are identical for two inputs)
I added this as a new function since it wasn't present and was one of
the known logic functions on Wikipedia.
No, there was no bug fixing motivation b
Am 21.03.2012 14:29, schrieb Rishav Das:
Please let me know whom I can get in contact with and what development
work I should proceed with. In order to get acquainted with the code
and meet the patch submission prerequisite, I've sent my first pull
request on GitHub.
https://github.com/sympy/sy
Please let me know whom I can get in contact with and what development
work I should proceed with. In order to get acquainted with the code
and meet the patch submission prerequisite, I've sent my first pull
request on GitHub.
https://github.com/sympy/sympy/pull/1154
On Mar 21, 6:52 am, Rishav D
Sounds good. I am just not sure if *implementing* a pure abstract
group class is the best way to go. From an implementation perspective,
it would be very convenient if the abstract group class encapsulates
the permutation group class. Implementing any other concrete group
will then require one to a
Have you played around with GAP or the Mathematica group functions? I know
GAP allows you to create abstract (non-permutation) groups. It would be a
good place to look for ideas.
Like I said earlier I was considering doing this as a GSoC project myself
if I had time. I'm still interested in th
I've created wiki page with appropriate details:
https://github.com/sympy/sympy/wiki/GSoC-2012-Application--Rishav-Binayak-Das--Mobile-Application-for-SymPy
And I'll now proceed to work on the patch!
On Mar 20, 10:30 am, Sergiu Ivanov wrote:
> Hello,
>
> On Tue, Mar 20, 2012 at 7:48 AM, Rishav
On Mar 20, 1:36 pm, David Joyner wrote:
> This seems good. It sounds like you plan on implementing
> permutation groups, and the methods you describe, which the
> user defines using a list of (permutation) generators.
> Is that your question?
Well I was thinking about a more abstract presentatio
On Tue, Mar 20, 2012 at 12:59 PM, Aleksandar Makelov
wrote:
>
> On Mar 20, 12:32 am, Saptarshi Mandal wrote:
>> The notes for a graduate course at Colorado State are also very
>> interesting. I referred to them for implementing some of the more
>> elementary algorithms.
>>
>> http://www.math.colo
On Mar 20, 12:32 am, Saptarshi Mandal wrote:
> The notes for a graduate course at Colorado State are also very
> interesting. I referred to them for implementing some of the more
> elementary algorithms.
>
> http://www.math.colostate.edu/~hulpke/CGT/CGT.html
Thanks for the reference!
I started
Maybe there is some gain in using Strassen multiplication on Z or Q in gmpy
mode.
Attached is an implementation; for matrices with entries randint(0,N)
and size n, I find that for N=10, 10**3, 10**6 the speedup increases with N;
the break even point is n=190; for n=448
the speedup with Strassen in
The notes for a graduate course at Colorado State are also very
interesting. I referred to them for implementing some of the more
elementary algorithms.
http://www.math.colostate.edu/~hulpke/CGT/CGT.html
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
I added group theory to the ideas page. It is still lacking in ideas,
so please edit it to add more kinds of things that you would like to
see in such a module.
Aaron Meurer
On Mon, Mar 19, 2012 at 2:29 PM, Nathan Alison
wrote:
>
>
> On Saturday, March 17, 2012 2:57:57 PM UTC-5, Aaron Meurer wr
On Saturday, March 17, 2012 2:57:57 PM UTC-5, Aaron Meurer wrote:
>
> On Sat, Mar 17, 2012 at 1:42 PM, Saptarshi Mandal wrote:
> >>
> >> And it would be awesome to have a group theory module. We presently
> >> only have a Permutation class in the combinatorics module, but other
> >> than that, w
Oh thanks a bunch! I feel the book will be *incredibly* helpful; and
yep I'll submit the pull request :)
Alex
On Mar 18, 9:16 am, Alan Bromborsky wrote:
> On 03/18/2012 12:09 AM, Aaron Meurer wrote:
>
>
>
>
>
>
>
> > I wouldn't trust much from that section anyway, though, since the
> > paper is
I wouldn't trust much from that section anyway, though, since the
paper is from 1998.
Aaron Meurer
On Sat, Mar 17, 2012 at 10:07 PM, Aaron Meurer wrote:
> Is that a preprint? Some of the sections seem unfinished (for
> example, section 10).
>
> Aaron Meurer
>
> On Sat, Mar 17, 2012 at 8:27 PM,
Is that a preprint? Some of the sections seem unfinished (for
example, section 10).
Aaron Meurer
On Sat, Mar 17, 2012 at 8:27 PM, Alan Bromborsky wrote:
> On 03/17/2012 04:59 PM, Aaron Meurer wrote:
>>
>> On Sat, Mar 17, 2012 at 2:45 PM, Aleksandar Makelov
>> wrote:
I think a main r
On Sat, Mar 17, 2012 at 2:45 PM, Aleksandar Makelov
wrote:
>
>> I think a main reference is "Permutation Group Algorithms" by Akos
>> Seress - Cambridge Tracts in Mathemathics 152 published 2003.
>
> Thanks! The "Handbook of computational group theory" also looks like
> serious business. Unfortun
> I think a main reference is "Permutation Group Algorithms" by Akos
> Seress - Cambridge Tracts in Mathemathics 152 published 2003.
Thanks! The "Handbook of computational group theory" also looks like
serious business. Unfortunately, neither of these is a free resource;
I might end up buying on
@David Joyner, my error was in what I call a permutation group (I did
not consider subgroups). Thanks for the correction.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from t
On 03/17/2012 04:11 PM, David Joyner wrote:
On Sat, Mar 17, 2012 at 3:55 PM, krastanov.ste...@gmail.com
wrote:
Is this necessary? All groups are isomorphic to the permutation group
anyway. Groups for specific structures can make use of functionality
implemented for them (matrix group -> sympy
On Sat, Mar 17, 2012 at 10:11 PM, David Joyner wrote:
> On Sat, Mar 17, 2012 at 3:55 PM, krastanov.ste...@gmail.com
> wrote:
>>>
>>> Is this necessary? All groups are isomorphic to the permutation group
>>> anyway. Groups for specific structures can make use of functionality
>>> implemented for t
On Sat, Mar 17, 2012 at 3:55 PM, krastanov.ste...@gmail.com
wrote:
>>
>> Is this necessary? All groups are isomorphic to the permutation group
>> anyway. Groups for specific structures can make use of functionality
>> implemented for them (matrix group -> sympy matrices, galois -> polys)
>> for ba
On Sat, Mar 17, 2012 at 1:42 PM, Saptarshi Mandal
wrote:
>>
>> And it would be awesome to have a group theory module. We presently
>> only have a Permutation class in the combinatorics module, but other
>> than that, we don't really have a good way to represent a group.
>
> Is this necessary? All
>
> Is this necessary? All groups are isomorphic to the permutation group
> anyway. Groups for specific structures can make use of functionality
> implemented for them (matrix group -> sympy matrices, galois -> polys)
> for basic operations and can implement the mapping to the perm group
> module f
>
> And it would be awesome to have a group theory module. We presently
> only have a Permutation class in the combinatorics module, but other
> than that, we don't really have a good way to represent a group.
Is this necessary? All groups are isomorphic to the permutation group
anyway. Groups fo
Hi Alex,
I worked as a student last year and may apply as mentor this year.
Please take a look at my branches in github. I was implementing the
Schreier Sims algorithm but I ran out of time unfortunately. You could
either help me merge my branches in or take off where I left.
Regards
Saptarshi
-
1 - 100 of 115 matches
Mail list logo
