相关论文: Algorithmic construction of representations of fin…

Let $G$ be a finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…

An approach to representations of finite groups is presented without recourse to character theory. Considering the group algebra C[G] as an algebra of linear maps on C[G] (by left multiplication), we derive the primitive central idempotents…

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

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

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

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 propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…

Suppose $G$ is a real reductive group. The determination of the irreducible unitary representations of $G$ is one of the major unsolved problem in representation theory. There is evidence to suggest that every irreducible unitary…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

The set of finitely generated subgroups of the group $PL_+(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that…

We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…

An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

We prove that $d(G) \log |G| = O(n^2 \log q)$ for irreducible subgroups $G$ of GL$(n,q)$, and estimate the associated constants. The result is motivated by attempts to bound the complexity of computing the automorphism groups of various…

We continue the study of glider representations of finite groups $G$ with given structure chain of subgroups $e \subset G_1 \subset \ldots \subset G_d = G$. We give a characterization of irreducible gliders of essential length $e \leq d$…

Let E be a division ring and G a finite group of automorphisms of E whose elements are distinct modulo inner automorphisms of E. Given a representation \rho: B-> GL(d,E) of an F-algebra B, we give necessary and sufficient conditions for…