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, fully
> > within Cython, if that was your desire. Eventually, it'd be nice to
> > have the PermutationGroup class use Robert's code by default.
>
> Emphasis on eventually. I plan on spending a lot of time in the future
> looking at GAP code, Jeffrey Leon's code, and other sources to try to
> make a top-notch permutation group library, but nobody should hold
> their breath. This will take a long time and a lot of hard work. The
> algorithms in GAP took years to establish, and people have written
> many papers and several books on the work done to get these algorithms
> right. The work in #10804 is more of a proof of concept and an
> intermediate tool to get canonical augmentation off the ground than
> finished product.
This sounds promising indeed! For enumeration purposes (like #6812 by
Nicolas B.), having an easy access to stabilizer chains and standard
methods to manipulate them would be great.
Just one question: do we have the manpower, within the Sage community,
to maintain this code in the long run?
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil" <nthi...@users.sf.net>
http://Nicolas.Thiery.name/
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
