Related papers: Permutation representations on invertible matrices
We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. The result is obtained by exploiting canonical forms for…
In this article, we study the irreducibility of representations of the singular braid group on $n$ strands, namely $SB_n$. Our first finding is the determination of the forms of all irreducible representations $\rho : SB_2 \to…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
We construct natural symbolic representations of intrinsically ergodic, but not necessarily expansive, principal algebraic actions of countably infinite amenable groups and use these representations to find explicit generating partitions…
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
Some randomized algorithms, used to obtain a random $n^2 \times n^2$ Sudoku matrix, where $n$ is a natural number, is reviewed in this study. Below is described the set $\Pi_n$ of all $(2n) \times n$ matrices, consisting of elements of the…
An equivalent definition of hypermatrices is introduced. The matrix expression of hypermatrices is proposed. Using permutation matrices, the conversion of different matrix expressions is revealed. The various contracted products of…
We use representation theory of $S_n$ to analyze the mixing of permutation cycle type statistics $a_j(\sigma) = ${# of $j$-cycles of $\sigma$} for any fixed $j$ and $\sigma$ resulting from a random $i$-cycle walk on $S_n$. We also derive…
Given two combinatorial identities proved earlier, a new set of variations of these combinatorial identities is listed and proved with the integral representation method. Some identities from literature are shown to be special cases of…
A finite subgroup of $GL(n,\mathbb C)$ is involutory if the sum of the dimensions of its irreducible complex representations is given by the number of absolute involutions in the group. A uniform combinatorial model is constructed for all…
The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…
The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of…
Multidimensional contractions of irreducible representations of the Cayley-Klein unitary algebras in the Gel'fand-Zetlin basis are considered. Contracted over different parameters, algebras can turn out to be isomorphic. In this case method…
We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $\lambda$…
The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…
We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows…
This work examines the concept of S-permutation matrices, namely $n^2 \times n^2$ permutation matrices containing a single 1 in each canonical $n \times n$ subsquare (block). The article suggests a formula for counting mutually disjoint…
We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…
The paper is devoted to the study of some well-knonw combinatorial functions on the symmetric group $\sn$ --- the major index $\maj$, the descent number $\des$, and the inversion number $\inv$ --- from the representation-theoretic point of…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…