Related papers: Computing the Zariski closure of a finitely genera…

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

The article demonstrates the procedure how to compute the Zariski closure of an orbit by an algebraic action of finitely generated group on the affine plane. First half of the algorithm is about deciding whether given finitely generated…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…

We define Lie subalgebras of the group algebra of a finite pseudo-reflection group that are involved in the definition of the Cherednik KZ-systems, and determine their structure. We provide applications for computing the Zariski closure of…

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…

The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…

Let F be a finitely generated field of characteristic zero and \Gamma<GL_n(F) a finitely generated subgroup. For an element g in \Gamma, let Gal(F(g)/ F) be the Galois group of the splitting field of the characteristic polynomial of g over…

The objective of this paper is to describe the structure of Zariski closed algebras, which provide a useful generalization to finite dimensional algebras in the study of representable algebras over finite fields. Our results include a…

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 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…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…

Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

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.

The main result of this article is a refinement of the well-known subgroup separability results of Hall and Scott for free and surface groups. We show that for any finitely generated subgroup, there is a finite dimensional representation of…

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

We give a method to describe all congruence images of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n, \mathbb{Z})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree $n$; if…