Computing with Matrix Groups over Infinite Fields
نویسندگان
چکیده
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.
منابع مشابه
Algorithms for computing with nilpotent matrix groups over infinite domains
We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical nilpotency testing algorithm for matrix groups over an infinite field. We also provide algorithms to answer a number of structural questions for a nilpotent matrix group.The main algorithms h...
متن کاملSome Finite and Discrete Groups
We have have encountered several finite groups in the previous chapter: the cyclic group Zn, the symmetric group Sn, and its subgroup the alternating group An. The properties of these groups will be elaborated in this chapter. We will also discuss three other groups obtained by incorporating ‘reflections’ into Zn, the dihedral group Dn, the generalized quaterion group Qn, and the dicyclic group...
متن کاملThe critical groups of a family of graphs and elliptic curves over finite fields
Let q be a power of a prime, and E be an elliptic curve defined over Fq . Such curves have a classical group structure, and one can form an infinite tower of groups by considering E over field extensions Fqk for all k ≥ 1. The critical group of a graph may be defined as the cokernel of L(G), the Laplacian matrix of G. In this paper, we compare elliptic curve groups with the critical groups of a...
متن کاملRecognizing finite matrix groups over infinite fields
Article history: Received 12 January 2012 Accepted 10 April 2012 Available online 15 June 2012
متن کاملComputing the additive degree-Kirchhoff index with the Laplacian matrix
For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009