NDLI: Constructing permutation representations for large matrix groups

Please wait, while we are loading the content...

Computing selected solutions of polynomial equations

Automating the construction of stationary multiple-point classes

On the isomorphisms of smooth algebraic curves

Examples of automatic theorem proving a real geometry

A first report on the A# compiler

How to make AXIOM into a scratchpad

The Albert nonassociative algebra system: a progress report

GENTRAN 90: a REDUCE package for the generation of Fortran 90 code

Programming with algebraic structures: design of the MAGMA language

On a modular algorithm for computing GCDs of polynomials over algebraic number fields

Parallelization of the sparse modular GCD algorithm for multivariate polynomials on shared memory multiprocessors

Automatic identification of time scales in enzyme kinetics models

A system for the symbolic analysis of problems in engineering mechanics

Factoring high-degree polynomials by the black box Berlekamp algorithm

Algebraic and geometric reasoning using Dixon resultants

On computing sparse shifts for univariate polynomials

Monomial bases and polynomial system solving (extended abstract)

The Gröbner basis algorithm and subresultant theory

The shape of the Shape Lemma

Constructing permutation representations for large matrix groups

Computing normalizers in permutation p-groups

Constructing canonical presentations for subgroups of context-free groups in polynomial time (extended abstract)

Finding blocks of imprimitivity in small-base groups in nearly linear time

A conjecture on integration in finite terms with elementary functions and polylogarithms

Characteristic classes for irregular singularities

D'Alembertian solutions of linear differential and difference equations

Fast polynomial dispersion computation and its application to indefinite summation

An application of symbolic computation in the physical sciences

Computing parameterizations of rational algebraic curves

Implicitization of hypersurfaces and curves by the Primbasissatz and basis conversion

Sufficiency analysis for the calculus of variations

How to compute the Melnikov vector?

On the implementation of a new algorithm for the computation of hyperelliptic integrals

Algorithms for finding the structure of solutions of a system of linear partial differential equations

Algebraic geometry and group theory in geometric constraint satisfaction

Symbolic-numeric stability investigations of Jameson's schemes for the thin-layer Navier-Stokes equations

Chains of recurrences—a method to expedite the evaluation of closed-form functions

Branch cuts in computer algebra

Quantifier elimination for real algebra—the cubic case

An algorithm for complexes

A fine-grained parallel completion procedure

Symbolic-numeric nonlinear equation solving

The identity problem for elementary functions and constants

Signature functions for algebraic numbers

Asymptotically fast solution of Toeplitz-like singular linear systems

Fast algorithms for rational forms of integer matrices

Fast parallel computation of the Smith normal form of polynomial matrices

Inheritance of rewrite rule structures applied to symbolic computation

Algorithms for type inference with coercions

MP: a protocol for efficient exchange of mathematical expressions

An improved algorithm for factoring linear ordinary differential operators

The use of the special semi-groups for solving differential equations

Optical character recognition for typeset mathematics

On the symbolic insimplification of the general 6R-manipulator kinematic equations

Constructing permutation representations for large matrix groups

Content Provider	ACM Digital Library
Author	Finkelstein, Larry Cooperman, Gene Tselman, Michael York, Bryant
Abstract	New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n, can be 10,000,000 and larger. The key idea is to build the new permutation representation using the conjugation action on a conjugacy class of subgroups of prime order. A unique signature for each group element corresponding to the conjugacy class is used in order to avoid matrix multiplication. The requirement of at least n matrix multiplications would otherwise have made the computation hopelessly impractical. Additional software optimizations are described, which reduce the CPU time by at least an additional factor of 10. Further, a special data structure is designed that serves both as a search tree and as a hash array, while requiring space of only 1.6n log2 n bits.The technique has been implemented and tested on the sporadic simple group Ly, discovered by Lyons [9], in both a sequential (SPARCserver 670MP) and parallel SIMD (MasPar MP-1) version. Starting with a generating set for Ly as a subgroup of GL(111,5) [5], a set of generating permutations for Ly acting on 9, 606, 125 points is constructed as well as a base for this permutation representation. The sequential version required four days of CPU time to construct a data structure which can be used to compute the permutation image of an arbitrary matrix. The parallel version did so in 12 hours. Work is in progress on a faster parallel implementation.
Starting Page	134
Ending Page	138
Page Count	5
File Format	PDF
ISBN	0897916387
DOI	10.1145/190347.190384
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1994-08-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in