Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-21T16:34:53.967Z Has data issue: false hasContentIssue false

Computing with matrix groups over infinite fields

Published online by Cambridge University Press:  05 July 2011

By
A. S. Detinko ,
B. Eick  and
D. L. Flannery
Edited by
C. M. Campbell ,
M. R. Quick ,
E. F. Robertson ,
C. M. Roney-Dougal ,
G. C. Smith  and
G. Traustason
A. S. Detinko
Affiliation:
National University of Ireland, Ireland
B. Eick
Affiliation:
Institut Computational Mathematics, Germany
D. L. Flannery
Affiliation:
National University of Ireland, Ireland
C. M. Campbell
Affiliation:
University of St Andrews, Scotland
M. R. Quick
Affiliation:
University of St Andrews, Scotland
E. F. Robertson
Affiliation:
University of St Andrews, Scotland
C. M. Roney-Dougal
Affiliation:
University of St Andrews, Scotland
G. C. Smith
Affiliation:
University of Bath
G. Traustason
Affiliation:
University of Bath
Get access

Summary

Abstract

We survey currently available algorithms for computing with matrix groups over infinite domains. We discuss open problems in the area, and avenues for further development.

Introduction

The subject of linear groups is one of the main branches of group theory. Linear groups provide a link between group theory and natural sciences such as physics, chemistry, and genetics; as well as other areas of mathematics, including geometry, combinatorics, functional analysis, and differential equations.

The significance of linear groups was realized at the very beginning of group theory, dating back to work by C. Jordan (1870). In the early twentieth century, major successes in linear group theory were achieved by Burnside, Schur, Blichfeldt, and Frobenius; their results continue to exert an influence up to the present day.

Linear groups arise in various ways in the theory of abstract groups. For instance, they occur as groups of automorphisms of certain abelian groups, and they play a central role in the study of solvable groups. Furthermore, linearity is a vital property for some classes of groups: polycyclic-by-finite groups and countable free groups are prominent examples. Linear groups are closely associated to Lie groups, algebraic groups, and representation theory. For extra background we refer to [16, 48, 49, 50].

Advances in computational algebra have motivated a new phase in linear group theory. Matrix representations of groups have the advantage that a large (even infinite) group can be defined by input of small size.

Type
Chapter
Information
Groups St Andrews 2009 in Bath , pp. 256 - 270
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] B., Assmann and B., Eick, Polenta—Polycyclic presentations for matrix groups. A refereed GAP 4 package; see http://www.gap-system.org/Packages/polenta.html (2007).
[2] B., Assmann and B., Eick, Computing polycyclic presentations for polycyclic rational matrix groups, J. Symbolic Comput. 40 (2005), no. 6, 1269–1284.Google Scholar
[3] B., Assmann and B., Eick, Testing polycyclicity of finitely generated rational matrix groups, Math. Comp. 76 (2007), 1669–1682 (electronic).Google Scholar
[4] L., Babai, Local expansion of vertex-transitive graphs and random generation in finite groups, Proceedings of the twenty-third annual ACM symposium on theory of computing (New Orleans, LA, 1991), ACM, New York, 1991, pp. 164–174.Google Scholar
[5] L., Babai, Deciding finiteness of matrix groups in Las Vegas polynomial time, Proceedings of the third annual ACM-SIAM symposium on discrete algorithms (Orlando, FL, 1992), ACM, New York, 1992, pp. 33–40.Google Scholar
[6] L., Babai, R., Beals, J., Cai, G., Ivanyos, and E. M., Luks, Multiplicative equations over commuting matrices, Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms (Atlanta, GA, 1996) (1996), 498–507.Google Scholar
[7] L., Babai, R., Beals, and D. N., Rockmore, Deciding finiteness of matrix groups in deterministic polynomial time, Proceedings of the international symposium on symbolic and algebraic computation ISSAC '93, ACM, 1993, pp. 117–126.Google Scholar
[8] Robert, Beals, Algorithms for matrix groups and the Tits alternative, J. Comput. System Sci. 58 (1999), no. 2, 260–279, 36th IEEE symposium on the foundations of computer science (Milwaukee, WI, 1995).Google Scholar
[9] Robert, Beals, Improved algorithms for the Tits alternative, Groups and computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 63–77.Google Scholar
[10] A. S., Detinko, On deciding finiteness for matrix groups over fields of positive characteristic, LMS J. Comput. Math. 4 (2001), 64–72 (electronic).Google Scholar
[11] A. S., Detinko, B., Eick, and D. L., Flannery, Nilmat—Computing with nilpotent matrix groups over infinite fields 269 groups. A refereed GAP 4 package, (2007), see http://www.gap-system.org/Packages/nilmat.
[12] A. S., Detinko and D. L., Flannery, Computing in nilpotent matrix groups, LMS J. Comput. Math. 9 (2006), 104–134 (electronic).Google Scholar
[13] A. S., Detinko and D. L., Flannery, Algorithms for computing with nilpotent matrix groups over infinite domains, J. Symbolic Comput. 43 (2008), 8–26.Google Scholar
[14] A. S., Detinko and D. L., Flannery, On deciding finiteness of matrix groups, J. Symbolic Comput. 44 (2009), 1037–1043.Google Scholar
[15] A. S., Detinko, D. L., Flannery, and E. A., O'Brien, Deciding finiteness of matrix groups in positive characteristic, J. Algebra 322 (2009), 4151–4160.Google Scholar
[16] J. D., Dixon, The structure of linear groups, Van Nostrand Reinhold, London, 1971.Google Scholar
[17] J. D., Dixon, The orbit-stabilizer problem for linear groups, Canad. J. Math. 37 (1985), no. 2, 238–259.Google Scholar
[18] B., Eick, Computational group theory, Jahresbericht der DMV 107, Heft 3 (2005), 155–170.Google Scholar
[19] B., Eick and W., Nickel, Polycyclic—Computation with polycyclic groups. A refereed GAP 4 package; see http://www.gap-system.org/Packages/polycyclic.html (2004).
[20] Bettina, Eick and Gretchen, Ostheimer, On the orbit-stabilizer problem for integral matrix actions of polycyclic groups, Math. Comp. 72 (2003), no. 243, 1511–1529 (electronic).Google Scholar
[21] G., Ge, Algorithms related to multiplicative representations of algebraic numbers, Ph.D. thesis, U. C. Berkeley, 1993.
[22] S. P., Glasby, The Meat-Axe and f-cyclic matrices, J. Algebra 300 (2006), no. 1, 77–90.Google Scholar
[23] D. F., Holt, B., Eick, and E. A., O'Brien, Handbook of computational group theory, Chapman & Hall/CRC Press, Boca Raton, London, New York, Washington, 2005.Google Scholar
[24] Derek F., Holt, The Meataxe as a tool in computational group theory, The atlas of finite groups: ten years on (Birmingham, 1995), LMS Lecture Note Ser., vol. 249, CUP, Cambridge, 1998, pp. 74–81.Google Scholar
[25] G., Ivanyos, Deciding finiteness for matrix semigroups over function fields over finite fields, Israel J. Math. 124 (2001), 185–188.Google Scholar
[26] Gábor, Ivanyos and Lajos, Rónyai, Computations in associative and Lie algebras, Some tapas of computer algebra, Algorithms Comput. Math., vol. 4, Springer, Berlin, 1999, pp. 91–120.Google Scholar
[27] V. M., Kopytov, The solvability of the occurrence problem in finitely generated solvable matrix groups over an algebraic number field, Algebra i Logika 7 (1968), no. 6, 53–63 (Russian).Google Scholar
[28] C. R., Leedham-Green, The computational matrix group project, Groups and computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 229–247.Google Scholar
[29] S. A., Linton, On vector enumeration, Linear Algebra Appl. 192 (1993), 235–248, Computational linear algebra in algebraic and related problems (Essen, 1992).Google Scholar
[30] Eddie H., Lo and Gretchen, Ostheimer, A practical algorithm for finding matrix representations for polycyclic groups, J. Symbolic Comput. 28 (1999), no. 3, 339–360.Google Scholar
[31] E., Luks, Computing in solvable matrix groups, Proc. 33rd IEEE symposium on foundations of computer science, pp. 111–120, 1992.Google Scholar
[32] Charles F., Miller Jr, On group-theoretic decision problems and their classification, Princeton University Press, Princeton, N.J., 1971, Annals of Mathematics Studies, No. 68.Google Scholar
[33] G., Nebe and A., Steel, Recognition of division algebras, J. Algebra 322 (2009), 903–909.Google Scholar
[34] Morris, Newman, Integral matrices, Academic Press, New York, 1972.Google Scholar
[35] Werner, Nickel, Matrix representations for torsion-free nilpotent groups by Deep Thought, J. Algebra 300 (2006), no. 1, 376–383.Google Scholar
[36] E. A., O'Brien, Towards effective algorithms for linear groups, Finite geometries, groups, and computation, Walter de Gruyter, Berlin, 2006, pp. 163–190.Google Scholar
[37] Gretchen, Ostheimer, Practical algorithms for polycyclic matrix groups, J. Symbolic Comput. 28 (1999), no. 3, 361–379.Google Scholar
[38] Richard A., Parker, An integral meataxe, The atlas of finite groups: ten years on (Birmingham, 1995), LMS Lecture Note Ser., vol. 249, CUP, Cambridge, 1998, pp. 215–228.Google Scholar
[39] W., Plesken, Finite rational matrix groups: a survey, The atlas of finite groups: ten years on (Birmingham, 1995), LMS Lecture Note Ser., vol. 249, CUP, Cambridge, 1998, pp. 229–248.Google Scholar
[40] W., Plesken, Presentations and representations of groups, Algorithmic algebra and number theory (Heidelberg, 1997), Springer, Berlin, 1999, pp. 423–434.Google Scholar
[41] Wilhelm, Plesken and Bernd, Souvignier, Constructing rational representations of finite groups, Experiment. Math. 5 (1996), no. 1, 39–47.Google Scholar
[42] D. N., Rockmore, K.-S., Tan, and R., Beals, Deciding finiteness for matrix groups over function fields, Israel J. Math. 109 (1999), 93–116.Google Scholar
[43] Lajos, Rónyai, Computations in associative algebras, Groups and computation (New Brunswick, NJ, 1991), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 11, Amer. Math. Soc., Providence, RI, 1993, pp. 221–243.Google Scholar
[44] Ákos, Seress, A unified approach to computations with permutation and matrix groups, International Congress of Mathematicians. Vol. II, Eur. Math. Soc., ZÜrich, 2006, pp. 245–258.Google Scholar
[45] Charles C., Sims, Computing the order of a solvable permutation group, J. Symbolic Comput. 9 (1990), no. 5-6, 699–705, Computational group theory, Part 1.Google Scholar
[46] Charles C., Sims, Computation with finitely presented groups, Encyclopedia of Mathematics and Its Applications, vol. 48, CUP, New York, 1994.
[47] Bernd, Souvignier, Decomposing homogeneous module of finite groups in zero characteristic, J. Algebra 322 (2009), 948–956.Google Scholar
[48] D. A., Suprunenko, Matrix groups, Transl. Math. Monogr., vol. 45, American Mathematical Society, Providence, RI, 1976.Google Scholar
[49] B. A. F., Wehrfritz, Infinite linear groups, Springer-Verlag, 1973.Google Scholar
[50] A. E., Zalesskiĭ, Linear groups, Russian Math. Surveys 36 (1981), no. 5, 63–128.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×