BOOK-CHAPTER
Computing with matrix groups over infinite fields
A. S. DetinkoBettina EickDane Flannery
Year: 2011 Cambridge University Press eBooks Pages: 256-270 Publisher: Cambridge University Press
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.
Keywords:
Matrix (chemical analysis) Computer science Mathematics Algebra over a field Pure mathematics Materials science
Metrics
9
Cited By
2.63
FWCI (Field Weighted Citation Impact)
47
Refs
0.90
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Coding theory and cryptography
Physical Sciences → Computer Science → Artificial Intelligence
Finite Group Theory Research
Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics
Algebraic structures and combinatorial models
Physical Sciences → Mathematics → Geometry and Topology
Related Documents
JOURNAL ARTICLE
Recognizing finite matrix groups over infinite fields
A. S. DetinkoDane FlanneryE. A. O’Brien
Journal: Journal of Symbolic Computation Year: 2012 Vol: 50 Pages: 100-109
JOURNAL ARTICLE
Algorithms for computing with nilpotent matrix groups over infinite domains
Journal: Journal of Symbolic Computation Year: 2007 Vol: 43 (1)Pages: 8-26
JOURNAL ARTICLE
Computation with matrix groups over finite fields
Journal: DIMACS series in discrete mathematics and theoretical computer science Year: 1993 Pages: 189-195