On Sat, Aug 25, 2012 at 2:22 PM, David Joyner wrote:
> On Thu, Aug 23, 2012 at 11:16 AM, Chris Smith wrote:
>
> ...
>
>>
>> Do you mean cyclic notation, like ((123)(465)) ?
>>
>> We have that, but I think it uses the unconventional R to L rather
>> than L to R convention:
>>
> p=Permutation
>
Well, one way to "fix" it would be to overload __pow__ so that P**int
does the usual power but P**P does multiplication...but python will
parse this from R to L. Does P**P have meaning of its own?
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post
OK, I've finished that work. I would appreciate a review, as this is
blocking on the release.
All deprecated features now have the issue and
deprecated_since_version flag. Additionally, all issues for
deprecated features are marked with the DeprecationRemoval tag
(http://code.google.com/p/sympy/i
On Thu, Aug 23, 2012 at 11:16 AM, Chris Smith wrote:
...
>
> Do you mean cyclic notation, like ((123)(465)) ?
>
> We have that, but I think it uses the unconventional R to L rather
> than L to R convention:
>
p=Permutation
p([[1,2],[0],[3]])*p([[2,3],[0],[1]]
> ... )
> Permutation([0,
I just updated the branch; you should be able to repull and have the
changes updated there. Nothing too major, though.
btw, I'm not sure if adding the 0 is a good way to go or not. I'm
trying to make it as compatible as possible for the person sitting
down to use this who is already familiar with
I got rid of the `full_cyclic_form0` function. A zero will
automatically be added (and basically ignored) if you don't use it.
--
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 f
On Fri, Aug 24, 2012 at 12:09 AM, Chris Smith wrote:
> With the aid of a manipulable dodecahedron I was able to construct the
> permutation group. All pgroups of the polyhedra are now included in
> Polyhedron. Thanks for the encouragement.
>
> I added a lot to the documentation with hopes of it be
Right, we need to be careful about infinite solutions. solve()
currently doesn't handle them, but it one day will.
I think the solution is to just have it return a Set object. Sets are
pretty advanced by now so that they can represent things like log(x) +
n*pi*I or asin(x) + 2*n*pi, for n intege
On Sat, Aug 25, 2012 at 1:11 PM, Aaron Meurer wrote:
> A few things here:
>
> - As git correctly points out, git...@github.com/smichr/sympy.git is
> not a valid URL. A more correct URL is
> g...@githib.com:smichr/sympy.git, but that is also incorrect in this
> situation because that is Chris's pri
I'd say this is a bug. It looks like it's been fixed at
https://github.com/sympy/sympy/pull/1053. That PR seems to have been
stalled, so maybe you could see what needs to be done.
An obvious work-around is to pull out the 2 from the qapply:
In [19]: print 2*qapply(tensor_product_simp(projUV*vec
> git clone git://github.com/sympy/sympy.git
> cd sympy
> git remote add smichr git...@github.com/smichr/sympy.git
slap forehead: a colon
git remote add smichr git...@github.com:smichr/sympy.git
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post
A few things here:
- As git correctly points out, git...@github.com/smichr/sympy.git is
not a valid URL. A more correct URL is
g...@githib.com:smichr/sympy.git, but that is also incorrect in this
situation because that is Chris's private ssh URL, which only he can
use. What you should do is go to
On Sat, Aug 25, 2012 at 10:56 AM, Chris Smith wrote:
>>> git add remote smichr git...@github.com/smichr/sympy.git
>
>
> Sorry. Make that git remote add smichr git...@github.com/smichr/sympy.git
git clone git://github.com/sympy/sympy.git
cd sympy
git remote add smichr git...@github.com/smichr/sym
Hi All!
I am working on a research problem and wanted to use sympy's quantum module
to do the calculations, because sympy has abstract Ket objects on which one
can do many operations without assigning them actual values. I come up with
a difficulty
Say I have two Hilbert spaces U and V and on eac
>> git add remote smichr git...@github.com/smichr/sympy.git
Sorry. Make that git remote add smichr git...@github.com/smichr/sympy.git
--
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 unsu
On Sat, Aug 25, 2012 at 10:21 AM, Chris Smith wrote:
>>
>> Can you please explain, in terms a complete idiot like me can understand,
>> what steps I go through to test your code? I have access to macs
>> (running lion) and linux (running ubuntu 12.04), both with git installed.
>> Someone told me o
>
> Can you please explain, in terms a complete idiot like me can understand,
> what steps I go through to test your code? I have access to macs
> (running lion) and linux (running ubuntu 12.04), both with git installed.
> Someone told me once with Aleksander M's branches but I've forgotten the
> s
On Sat, Aug 25, 2012 at 9:52 AM, Chris Smith wrote:
> On Sat, Aug 25, 2012 at 4:12 PM, Tom Bachmann wrote:
>>
>>
>> On 25.08.2012 10:40, Chris Smith wrote:
>
> We have that, but I think it uses the unconventional R to L rather
> than L to R convention:
>
>>> p=Permutation
On Sat, Aug 25, 2012 at 4:12 PM, Tom Bachmann wrote:
>
>
> On 25.08.2012 10:40, Chris Smith wrote:
We have that, but I think it uses the unconventional R to L rather
than L to R convention:
>>>
>> p=Permutation
>>>
>>> p([[1,2],[0],[3]])*p([[2,3],[0],[1]]
On 25.08.2012 10:40, Chris Smith wrote:
We have that, but I think it uses the unconventional R to L rather
than L to R convention:
p=Permutation
p([[1,2],[0],[3]])*p([[2,3],[0],[1]]
... )
Permutation([0, 2, 3, 1])
_.cyclic_form
[[1, 2, 3], [0]]
http://en.wikipedia.org/wiki/Cycle_notat
> " Although only 2 permutations are needed for a polyhedron in order to
>generate all the possible orientations, it is customary to give a
>group of permutations (P0, P1, ...) such that powers of them alone are
> able to generate the orientations, e.g. P0, P0**2, P0**3, P1, P1**2,
>
>> We have that, but I think it uses the unconventional R to L rather
>> than L to R convention:
>>
>
p=Permutation
> p([[1,2],[0],[3]])*p([[2,3],[0],[1]]
>> ... )
>> Permutation([0, 2, 3, 1])
> _.cyclic_form
>> [[1, 2, 3], [0]]
>>
>>
>> http://en.wikipedia.org/wiki/Cycle_notation says
Am 25.08.2012 11:14, schrieb G B:
In the specific case of atan2, I think there's a short term solution
in the sense that atan2(y,x) can be seen as a form of atan(y/x).
Perhaps, at least temporarily, it can be treated as nested operations
for the sake of inversion which saves us the headache of de
I agree it probably is cleaner to have the functions responsible for their own
inverses, and also agree that it will require some thought to handle the
ambiguities. In particular the cases where the ambiguities don't lead to a
finite solution set (inverting asin, for example?). I know some CAS
Am 25.08.2012 06:56, schrieb Aaron Meurer:
I think this is doable. We just need to extend the algorithm to
handle inverses of multi-argument functions.
By the way, we also should think of an API to let functions define
their own inverses which would be recognized by solve(). That would
be bett
25 matches
Mail list logo
