相关论文: Finding irreducible representation of symmetry ope…

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…

The irreducible representations of all of the 80 diperiodic groups, being the symmetries of the systems translationally periodical in two directions, are calculated. To this end, each of these groups is factorized as the product of a…

We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

We propose the method for obtaining invariants of arbitrary representations of Lie groups that reduces this problem to known problems of linear algebra. The basis of this method is the idea of a special extension of the representation…

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…

The chief aim of this paper is to describe a procedure which, given a $d$-dimensional absolutely irreducible matrix representation of a finite group over a finite field $\mathbb{E}$, produces an equivalent representation such that all…

We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…

We construct representation theory of Lie algebras with filtrations. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found.

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

Using our recent results on eigenvalues of invariants associated to the Lie superalgebra gl(m|n), we use characteristic identities to derive explicit matrix element formulae for all gl(m|n) generators, particularly non-elementary…

Let $\Gamma$ be a non-commutative free group on finitely many generators. In a previous work two of the authors have constructed the class of multiplicative representations of $\Gamma$ and proved them irreducible as representation of…

We review the enveloping algebra of the 10 dimensional chiral sigma matrices. To facilitate the computation of the product of several chiral sigma matrices we have developed a symbolic program. Using this program one can reduce the…

The problem of construction of irreducible representations of quantum $A^q_n$ algebras is solved at the level of explicit integration of the linear (inhomogeneous) system in finite differences in the n-dimensional space. The general…

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

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…

This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…

We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…