A better workaround is something like:
sage: P = PermutationGroup([(0,1)], domain=[0,1]); P
Permutation Group with generators [(0,1)]
sage: P.domain()
{0, 1}
sage: P.list()
[(), (0,1)]
--Mike
--Mike
On Mon, Jul 1, 2013 at 12:28 AM, Rob Beezer wrote:
> All,
>
> A power user sent me something ak
I try to implement the Poincaré-Birkhoff-Witt basis of the free algebra.
I defined the elements of this basis and a function which gives the
expansion of an element of the free algebra on this basis; actually, it
returns a dictionary whose keys are monomials and whose values are the
correspondi
All,
A power user sent me something akin to:
sage: PermutationGroup([(1,2)])
Permutation Group with generators [(1,2)]
sage: PermutationGroup([('a','b')])
Permutation Group with generators [('a','b')]
sage: PermutationGroup([(0,1)])
--
On Sun, 30 Jun 2013 13:23:50 -0700 (PDT)
Eric Gourgoulhon wrote:
> Meanwhile, I've written the following workaround in python:
> basically, it scans all the sqrt's in a given symbolic expression,
> send them to radcan, takes the absolute value of the output and then
> calls simplify(). It is not
Le vendredi 21 juin 2013 07:00:54 UTC+2, rjf a écrit :
>
> Yes, I wrote radcan. The full source of it is available. I think it is in
> file rat3e.lisp. Look for
> (defun $radcan
> or perhaps (defmfun $radcan
>
> I think that if you wish to modify it to make a function with another
> name, you
Hi there.
A draft of the build systems for sage is now available on github [1].
The commits are based on the "working" branch, which represents the
current transition from hg to git.
The top level build system now not only disables unneeded packages
automatically (e.g. gcc, iconv), but also allow
