Tensors, matchings and codes (Q765171): Difference between revisions

The authors continue the study of connections between matchings on bipartite graphs, coding theory and symmetry classes of tensors initiated in [\textit{J.~A.~Dias da Silva} and \textit{M.~M.~Torres}, Linear Algebra Appl. 401, 77--107 (2005; Zbl 1077.15025); Linear Algebra Appl. 414, No. 2--3, 474--491 (2006; Zbl 1092.05072)]. They exploit the structure of the critical orbital sets of symmetry classes of tensors associated to sign uniform partitions. In particular, it is proved that the orthogonal dimension of the critical orbital sets associated with single hook partitions \(\lambda=(w,1^{n-w})\) equals the value of the coding theoretic function \(A(n,4,w)\). For other partitions lower and upper bounds for this dimension, i.e., the maximal cardinality of an orthogonal set of critical symmetrized tensors, by means of the function \(A(n,d,w)\) are given. When \(w=2\) this number is interpreted as the independence number of the Dynkin diagram \(A_{n-1}\).