Related papers: Algorithmic construction of representations of fin…

Let $G$ be a finite group and let $p$ be a prime. We continue the search for generic constructions of free products and free monoids in the unit group $\mathcal{U}(\mathbb{Z}G)$ of the integral group ring $\mathbb{Z}G$. For a nilpotent…

We study finite groups $G$ with elements $g$ such that $\lvert \mathbf{C}_G(g)\rvert = \lvert G:G' \rvert$. (Such elements generalize fixed-point-free automorphisms of finite groups.) We show that these groups have a unique conjugacy class…

We describe the structure of the irreducible representations of crossed products of unital C*-algebras by actions of finite groups in terms of irreducible representations of the C*-algebras on which the groups act. We then apply this…

A group $G$ given by a presentation $G = < \mathcal A \| \mathcal R >$ is called weakly finitely presented if every finitely generated subgroup of $G$, generated by (images of) some words in $\mathcal A^{\pm 1}$, is naturally isomorphic to…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Assume $G$ is a solvable group whose elementary abelian sections are all finite. Suppose, further, that $p$ is a prime such that $G$ fails to contain any subgroups isomorphic to $C_{p^\infty}$. We show that if $G$ is nilpotent, then the…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We…

This paper is concerned with absolutely irreducible quasisimple subgroups $G$ of a finite general linear group $GL_d(\mathbb{F}_q)$ for which some element $g\in G$ of prime order $r$, in its action on the natural module…

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…

We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…

We prove that an element $g$ of prime order $>3$ belongs to the solvable radical $R(G)$ of a finite (or, more generally, a linear) group if and only if for every $x\in G$ the subgroup generated by $g, xgx^{-1}$ is solvable. This theorem…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…

The conjugation representation of a finite group $G$ is the complex permutation module defined by the action of $G$ on itself by conjugation. Addressing a problem raised by Hain motivated by the study of a Hecke action on iterated Shimura…

We construct, for any finite commutative ring $R$, a family of representations of the general linear group $\mathrm{GL}_n(R)$ whose intertwining properties mirror those of the principal series for $\mathrm{GL}_n$ over a finite field.