Related papers: Recognizing finite matrix groups over infinite fie…
Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…
The chief aim of this paper is to describe a procedure which, given a $d$-dimensional absolutely irreducible matrix representation of a finite group over a finite field $\mathbb{E}$, produces an equivalent representation such that all…
Groups of almost upper triangular infinite matrices with entries indexed by integers are studied. It is shown that, when the matrices are over a finite field, these groups admit a nondiscrete totally disconnected, locally compact group…
Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…
The spectrum of a finite group is the set of element orders of this group. The main goal of this paper is to survey results concerning recognition of finite simple groups by spectrum, in particular, to list all finite simple groups for…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…
We describe an algorithm for determining whether a finite quandle is isomorphic to an Alexander quandle by finding all possible Alexander presentations of the quandle. We give an implementation of this algorithm in Maple.
Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called…
The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a simple combinatorial condition (the Triple Product Property).…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
In the present article we shown a formula to compute the number of all matrices over the finite field $F$ whit prescribed eigenvalues. Using this formula we obtain one inequality for the number of $(k+1)$-potent elements over finite rings.
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.
We apply the orbit method to obtain formula for multiplicities of certain representations of unipotent groups over the finite field.
In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
We establish several finiteness properties of groups defined by algebraic difference equations. One of our main results is that a subgroup of the general linear group defined by possibly infinitely many algebraic difference equations in the…