Skip to content

Commit

Permalink
ENHANCE: Faster rewriting systems for simple groups
Browse files Browse the repository at this point in the history
- Go thorough pcgroup for word expression iun Borel:
  as this will produce a word in the right ordering, rather than one obtained
  from a stabilizer chain (which will require more expensive rewriting).
- Don't run through all of Borel (but rely on MakeConfluent)
- Faster Borel rewriting (useful for large primes)
- Presentation for rewriting tries to use split generators:
  When getting a presentation for rewriting, try to ensure that the
  generating set chosen exposes direct factors of the radical factor.
  Otherwise there will be a a lot of messy tails which can be costly to
  clean up. (Basically this mimics some of what `SpecialPcgs` does.)
- Stored rewriting systems for some simple groups (up to certain size).
  • Loading branch information
hulpke authored and fingolfin committed Jul 23, 2020
1 parent 921af52 commit 9fe4735
Show file tree
Hide file tree
Showing 3 changed files with 21,616 additions and 18 deletions.
Loading

0 comments on commit 9fe4735

Please sign in to comment.