相关论文: Deciding finiteness of matrix groups in positive c…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

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 algorithm to test nilpotency of…

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…

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 address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

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…

In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…

Arithmetical properties of a finite group are properties of the group which are defined by its arithmetical parameters such as the order of the group, the element orders and so on. In this paper, we discuss a number of results on…

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We consider the actions of different groups G on the space M of m x n matrices with entries in the formal power series ring K[[x1,..., xs]], K an arbitrary field. G acts on M by analytic change of coordinates, combined with the…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

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…

This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.