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 group.
To
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
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
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
Thanks a bunch! I'll take a look.
Alex
On Mar 28, 3:03 pm, David Joyner wdjoy...@gmail.com 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
amake...@college.harvard.edu
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
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
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
amake...@college.harvard.edu wrote:
On Mar 24, 10:39 pm, Aaron Meurer asmeu...@gmail.com wrote:
How could it be too late?
Well yeah I
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
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
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 Meurer
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
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
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 been
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.
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
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
On Tue, Mar 27, 2012 at 8:42 AM, sachin004 sachin.iruk...@gmail.com 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
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
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 outputs
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 à 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
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
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 email
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 of
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
On Sat, Mar 24, 2012 at 8:26 PM, Aleksandar Makelov
amake...@college.harvard.edu 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
On Mar 24, 10:39 pm, Aaron Meurer asmeu...@gmail.com 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
On Sat, Mar 24, 2012 at 8:53 PM, Aleksandar Makelov
amake...@college.harvard.edu wrote:
On Mar 24, 10:39 pm, Aaron Meurer asmeu...@gmail.com 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
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 of
On Fri, Mar 23, 2012 at 10:55 PM, Saurabh Jha saurabh.j...@gmail.com 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
On Mar 22, 2:32 am, Joachim Durchholz j...@durchholz.org 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
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
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.
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
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
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 j...@durchholz.org wrote:
Am 21.03.2012 15:26, schrieb Rishav Das:
Xnor is defined for multiple inputs while logical equivalence is
defined only
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
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
On Mar 20, 12:32 am, Saptarshi Mandal sapta.iit...@gmail.com 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
On Tue, Mar 20, 2012 at 12:59 PM, Aleksandar Makelov
amake...@college.harvard.edu wrote:
On Mar 20, 12:32 am, Saptarshi Mandal sapta.iit...@gmail.com wrote:
The notes for a graduate course at Colorado State are also very
interesting. I referred to them for implementing some of the more
On Mar 20, 1:36 pm, David Joyner wdjoy...@gmail.com 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
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 unlimitedscol...@gmail.com wrote:
Hello,
On Tue, Mar 20,
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
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
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 abro...@verizon.net wrote:
On 03/18/2012 12:09 AM, Aaron Meurer wrote:
I wouldn't trust much from that section anyway, though, since the
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
nathan.f.ali...@gmail.com wrote:
On Saturday, March 17, 2012 2:57:57 PM
Hi,
Yup I'm looking at the GAP website now and it seems like a lot of fun;
I'm also looking for some kind of algorithm reference for
computational group theory like the ones listed at GAP. I'll have a
lot of work to do in the next couple of days (break's over) but will
try to implement at least
On 03/17/2012 05:10 AM, Aleksandar Makelov wrote:
Hi,
Yup I'm looking at the GAP website now and it seems like a lot of fun;
I'm also looking for some kind of algorithm reference for
computational group theory like the ones listed at GAP. I'll have a
lot of work to do in the next couple of days
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
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 for
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 for
On Sat, Mar 17, 2012 at 1:42 PM, Saptarshi Mandal
sapta.iit...@gmail.com 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
On Sat, Mar 17, 2012 at 10:11 PM, David Joyner wdjoy...@gmail.com wrote:
On Sat, Mar 17, 2012 at 3:55 PM, krastanov.ste...@gmail.com
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
On 03/17/2012 04:11 PM, David Joyner wrote:
On Sat, Mar 17, 2012 at 3:55 PM, krastanov.ste...@gmail.com
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
@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
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 one, I
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 abro...@verizon.net wrote:
On 03/17/2012 04:59 PM, Aaron Meurer wrote:
On Sat, Mar 17, 2012 at 2:45 PM, Aleksandar Makelov
Hi,
for the Galois group I'm using a rather naive approach for equations
of degree 4 or less - it's based on the theory given in a standard
textbook (Artin's Algebra, 2nd edition) - looking at the discriminant
and in the quartic case at the resolvent cubic. It's a solid algorithm
except for one
On Fri, Mar 16, 2012 at 4:12 PM, Aleksandar Makelov
amake...@college.harvard.edu wrote:
Hi,
for the Galois group I'm using a rather naive approach for equations
of degree 4 or less - it's based on the theory given in a standard
textbook (Artin's Algebra, 2nd edition) - looking at the
60 matches
Mail list logo
