Related papers: Matrix genetics, part 5: genetic projection operat…
The Kronecker product is an invaluable tool for data-sparse representations of large networks and matrices with countless applications in machine learning, graph theory and numerical linear algebra. In some instances, the sparsity pattern…
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…
Different ways of representing the group $SU(3)$ within a Geometric Algebra approach are explored. As part of this we consider characteristic multivectors for $SU(3)$, and how these are linked with decomposition of generators into commuting…
We study the supersymmetric ground states of the Kronecker model of quiver quantum mechanics. This is the simplest quiver with two gauge groups and bifundamental matter fields, and appears universally in four-dimensional N=2 systems. The…
The descent algebra of a finite Coxeter group W is a subalgebra of the group algebra defined by Solomon. Descent algebras of symmetric groups have properties that are not shared by other Coxeter groups. For instance, the natural map from…
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
There are two approaches to projective representation theory of symmetric and alternating groups, which are powerful enough to work for modular representations. One is based on Sergeev duality, which connects projective representation…
The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…
We show how to represent a class of expressions involving discrete sums over partitions as matrix models. We apply this technique to the partition functions of 2* theories, i.e. Seiberg-Witten theories with the massive hypermultiplet in the…
A unifying overview of the ways to parameterize the linear group GL(4.C) and its subgroups is given. As parameters for this group there are taken 16 coefficients G = G(A,B,A_{k}, B_{k}, F_{kl}) in resolving matrix G in terms of 16 basic…
In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…
We classify all the decomposition matrices of the generic Hecke algebras on 3 strands in characteristic 0. These are the generic Hecke algebras associated to the exceptional complex reflection groups $G_4$, $G_8$ and $G_{16}$. We prove that…
The main goal of this paper is to study the class of algebras for which the global dimension of the endomorphism ring of the generator-cogenerator, given by the sum of the projective and injective modules, is equal to three. We will refer…
Symmetry and antisymmetry are fundamental concepts in many strict sciences. Pairwise comparisons (PC) matrices are fundamental tools for representing pairwise relations in decision making. In this theoretical study, we present a novel…
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
We construct a family of involutions on the space $\mathfrak{gl}_n'(\mathbb C)$ of $n\times n$ matrices with real eigenvalues interpolating the complex conjugation and the transpose. We deduce from it a stratified homeomorphism between the…
A family of random matrices is said to converge strongly to a limiting family of operators if the operator norm of every noncommutative polynomial of the matrices converges to that of the limiting operators. Recent developments surrounding…
Coded computation is an emerging research area that leverages concepts from erasure coding to mitigate the effect of stragglers (slow nodes) in distributed computation clusters, especially for matrix computation problems. In this work, we…
We define operations that give the set of all Pythagorean triples a structure of commutative monoid. In particular, we define these operations by using injections between integer triples and $3 \times 3$ matrices. Firstly, we completely…
In the present paper we are dealing with reflection equation algebras ${\cal L}(R)$ corresponding to even skew-invertible Hecke symmetries. Our main result consists in computing the characters of the spectral values of the generating matrix…