Related papers: Pairs of Generators for Matrix Groups. I

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

Generators and defining relations for wreath products of groups are given. Under some condition (conormality of the generators) they are minimal. In particular, it is just the case for the Sylow subgroups of the symmetric groups.

We describe an algorithm for obtaining generators of the unit group of the integral group ring ZG of a finite abelian group G. We used our implementation in Magma of this algorithm to compute the unit groups of ZG for G of order up to 110.…

Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…

We investigate linearity of amalgams of subgroups of algebraic groups along intersections with algebraic subgroups. In the process, we establish linearity of certain "doubles" of linear groups, and obtain new examples of finitely generated…

In this article, we study the normal generation of the mapping class group. We first show that a mapping class is a normal generator if its restriction on the invariant subsurface normally generates the (pure) mapping class group of the…

We construct boundary quantum group generators which, through linear intertwining relations, determine nondiagonal solutions of the boundary Yang-Baxter equation for the cases A^1_{n-1} and A^2_2.

We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

The purpose of this paper is to shed more light on the transition from the known massless modular action to the wanted massive one in the case of forward light cones and double cones. The infinitesimal generator of the massive modular…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

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…

For ring of differential operators on smooth affine algebraic variety over perfect field of prime characteristic a set of algebra generators and a set of defining relations are found explicitly.

We present a new tree-level matrix element generator, based on the colour dressed Berends-Giele recursive relations. We discuss two new algorithms for phase space integration, dedicated to be used with large multiplicities and colour…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and…

We use group theoretic methods to obtain the extended Lie point symmetries of the equations of motion for a charged particle in the field of a monopole. Cases with certain model magnetic fields and potentials are also studied. Our analysis…

The algebra of symmetric functions contains several interesting families of symmetric functions indexed by integer partitions or skew partitions. Given a sequence $\{u_n\}$ of symmetric functions taken from one of these families such that…

For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…

Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…