Computing tensor decompositions of finite matrix groups
暂无分享,去创建一个
[1] Cheryl E. Praeger,et al. A Recognition Algorithm for Special Linear Groups , 1992 .
[2] László Babai,et al. Polynomial-time theory of matrix groups , 2009, STOC '09.
[3] Peter A. Brooksbank,et al. Fast constructive recognition of black box symplectic groups , 2008 .
[4] William M. Kantor,et al. Fast constructive recognition of black box orthogonal groups , 2006 .
[5] J. Conway,et al. ATLAS of Finite Groups , 1985 .
[6] William M. Kantor,et al. On constructive recognition of a black box PSL , 2001 .
[7] László Babai,et al. On the Number of p -Regular Elements in Finite Simple Groups , 2009 .
[8] W. Bosma,et al. HANDBOOK OF MAGMA FUNCTIONS , 2011 .
[9] John N. Bray. An improved method for generating the centralizer of an involution , 2000 .
[10] Á. Seress. Permutation Group Algorithms , 2003 .
[11] Derek F. Holt,et al. Computing Matrix Group Decompositions with Respect to a Normal Subgroup , 1996 .
[12] Martin W. Liebeck,et al. The Subgroup Structure of the Finite Classical Groups , 1990 .
[13] Peter A. Brooksbank. Fast Constructive Recognition of Black-Box Unitary Groups , 2003 .
[14] Ákos Seress,et al. A data structure for a uniform approach to computations with finite groups , 2006, ISSAC '06.
[15] Eugene M. Luks,et al. Computing in solvable matrix groups , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[16] László Babai,et al. Las Vegas algorithms for matrix groups , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[17] C. R. Leedham-Green,et al. The computational matrix group project , 2001 .
[18] Michael Aschbacher,et al. On the maximal subgroups of the finite classical groups , 1984 .
[19] E. F. Robertson,et al. ALGORITHMS FOR MATRIX GROUPS , 2011 .
[20] Cheryl E. Praeger,et al. A black-box group algorithm for recognizing finite symmetric and alternating groups, I , 2003 .