Loading...
Please wait, while we are loading the content...
Similar Documents
A data structure for a uniform approach to computations with finite groups (2006)
| Content Provider | CiteSeerX |
|---|---|
| Author | Neunhöffer, Max Seress, Akos |
| Description | We describe a recursive data structure for the uniform handling of permutation groups and matrix groups. This data structure allows the switching between permutation and matrix representations of segments of the input group, and has wide-ranging applications. It provides a framework to process theoretical algorithms which were considered too complicated for implementation such as the asymptotically fastest algorithms for the basic handling of large-base permutation groups and for Sylow subgroup computations in arbitrary permutation groups. It also facilitates the basic handling of matrix groups. The data structure is general enough for the easy incorporation of any matrix group or permutation group algorithm code; in particular, the library functions of the GAP computer algebra system dealing with permutation groups and matrix groups work with a minimal modification. |
| File Format | |
| Language | English |
| Publisher Date | 2006-01-01 |
| Publisher Institution | IN PROC. INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC’06), ACM |
| Access Restriction | Open |
| Subject Keyword | Easy Incorporation Input Group Minimal Modification Uniform Approach Large-base Permutation Group Arbitrary Permutation Group Basic Handling Gap Computer Algebra System Sylow Subgroup Computation Data Structure Wide-ranging Application Recursive Data Structure Theoretical Algorithm Matrix Representation Permutation Group Matrix Group Finite Group Library Function Uniform Handling |
| Content Type | Text |
| Resource Type | Article |
