Graded polynomial identities for matrices with the transpose involution (Q738891): Difference between revisions

Let \(G\) be a group of order \(k\) embedded in the symmetric group \(S_k\) via the regular representation. The \(k\times k\) matrix algebra \(M_k({\mathbb C})\) can be viewed as a crossed product with respect to \(G\) by embedding the elements of \(S_k\) in \(M_k({\mathbb C})\) in the usual way as permutation matrices. This induces a natural \(G\)-grading on \(M_k({\mathbb C})\) which the authors call a crossed-product grading: The \(g\)-homogeneous component of \(M_k({\mathbb C})\) consists of the matrices \(D_kP_g\), where \(D_k\) is the set of diagonal matrices and \(P_g\) is the permutation matrix corresponding to \(g\in G\). In the paper under review, the authors study the graded \(\ast\)-polynomial identities for \(M_k({\mathbb C})\) equipped with such a crossed-product grading and the transpose involution. To each multilinear monomial in the free graded algebra with involution they associate a directed labeled graph. Using these graphs the authors produce a basis (a set of generators) of the \((T,\ast)\)-ideal of identities for \(M_k({\mathbb C})\). The basis is very simple and does not depend on the group \(G\). As an application the authors give new proofs of the results of \textit{B. Kostant} [J. Math. Mech. 7, 237--264 (1958; Zbl 0087.25702)] and \textit{L. H. Rowen} [Trans. Am. Math. Soc. 190, 253--284 (1974; Zbl 0286.16012)] on the standard identities satisfied by skew matrices. For this purpose they use an analogue of the Swan theorem on paths of length \(2k\) in a directed graph with \(k\) vertices. [\textit{R. G. Swan}, Proc. Am. Math. Soc. 14, 367--373 (1963; Zbl 0118.01802); Proc. Am. Math. Soc. 21, 377--380 (1969; Zbl 0186.06003)]. Finally, the authors determine an asymptotic formula for the graded codimension of \(M_k({\mathbb C})\): \[ c_n^G\sim {k\over 2^{k-1}}k^{2n}, \] and, for \(k=2\), the exact formula \(c_n^G=4^n-2^n+1\).