Constructing Permutation Representations for Matrix Groups

Author： Cooperman G.   Finkelstein L.   Tselman M.   York B.  

Publisher： Academic Press

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.24, Iss.3, 1997-09, pp. : 471-488

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Analysing Finitely Presented Groups by Constructing Representations

By Plesken W.   Souvignier B.  

Journal of Symbolic Computation, Vol. 24, Iss. 3, 1997-09 ,pp. : 335-349

Academic Press

Access to resources Recommend Favorite

A Practical Algorithm for Finding Matrix Representations for Polycyclic Groups

By Lo E.H.   Ostheimer G.  

Journal of Symbolic Computation, Vol. 28, Iss. 3, 1999-09 ,pp. : 339-360

Academic Press

Access to resources Recommend Favorite

Constructing Faithful Representations of Finitely-generated Torsion-free Nilpotent Groups

By de Graaf W.A.   Nickel W.  

Journal of Symbolic Computation, Vol. 33, Iss. 1, 2002-01 ,pp. : 31-41

Academic Press

Access to resources Recommend Favorite

Computing Sylow Subgroups in Permutation Groups

By Cannon J.   Cox B.   Holt D.  

Journal of Symbolic Computation, Vol. 24, Iss. 3, 1997-09 ,pp. : 303-316

Academic Press

Access to resources Recommend Favorite

Some Algorithms for Nilpotent Permutation Groups

By Luks E.M.   Rakoczi F.   Wright C.R.B.  

Journal of Symbolic Computation, Vol. 23, Iss. 4, 1997-04 ,pp. : 335-354

Academic Press

Access to resources Recommend Favorite