Hi,
Pickling of permutation groups is broken, and has been broken for a
while:
sage: G = PermutationGroup([[(1,2,3),(4,5)],[(3,4)]])
sage: G.category()
Category of finite permutation groups
sage: H = loads(dumps(G))
sage: H.category()
Category of sets
Analysis: th
Is anyone else chiming in here planning to be in Galway next week for
the De Brun workshop? I'm giving a talk related to doing such
computations on more modern hardware and architectures. (I've been
playing with a randomized parallel partition backtrack with C and
mpi/openmp/cuda.) There was also s
Hi Robert!
On Thu, Apr 07, 2011 at 11:54:16PM -0700, Robert Miller wrote:
> Tom wrote:
> > Robert Miller has been hard at work implementing stabilizer chains for
> > permutation groups (see #10804). It should be fairly easy to
> > enumerate iterate over the elements of a permutation group
In another thread (finite complex reflection groups and matrices over
the universal cyclotomic field), Christian wrote:
> - is there a Sage implementation of permutation groups, or only the
> gap implementation (it takes very long to go through the elements of a
> permutation group, even in small e
sage: I = [3, 13, 16, 7, 15, 23, 6, 9, 10, 18, 5, 19, 24, 14, 25, 2,
11, 21, 4, 1, 12, 17, 8, 20, 22, 26]
sage: G = SymmetricGroup(26)
sage: G(I)
I can't trace where the PermList string is getting lost on the way to
or from the GAP interpreter,
but here's a problem:
sage: gap.eval('PermList(' +
Hi David J et al.,
There are two "natural" representations for permutations, cycles, and
enumerated
lists of images (or indices). In addition to this constructor:
sage: G = SymmetricGroup(14)
sage: G = SymmetricGroup(4)
sage: g = G("(1,2,3,4)")
sage: g(1)
2
sage: [ g(i+1) for i in range(4) ]
[
