Sweeping words and the length of a generic vector subspace of M_n(F)

DOI10.1016/J.JCTA.2016.05.003MaRDI QIDQ530766zbMATH OpenOpenAlexFDO

Authors Igor Klep, Špela Špenko

Publication date 1 August 2016

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.03460

zbMATH Keywords

discriminantmatrix algebrafree algebrageneric matrixdirected multigraphlength of a vector spacelocal linear independencePaz conjecture

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Algebraic systems of matrices (15A30)

Abstract: The main result of this short note is a generic version of Paz's conjecture on the lengths of generating sets in matrix algebras. Consider a generic g-tuple A=(A_1,..., A_g) of nxn matrices over a field. We show that whenever $g^{2d}geq{n}^2$, the set of all words of degree 2d in A spans the full nxn matrix algebra. Our proofs use generic matrices, are combinatorial and depend on the construction of a special kind of directed multigraphs with few edge-disjoint walks.

Recommendations

• A resolution of Paz's conjecture in the presence of a nonderogatory matrix
• An improved bound for the lengths of matrix algebras
• Words containing a basis for the algebra of all matrices
• Length computation of matrix subalgebras of special type.
• The effect of assuming the identity as a generator on the length of the matrix algebra

Cites work

• scientific article; zbMATH DE number 3899082 (Why is no real title available?)
• scientific article; zbMATH DE number 3721092 (Why is no real title available?)
• scientific article; zbMATH DE number 1217561 (Why is no real title available?)
• scientific article; zbMATH DE number 2002746 (Why is no real title available?)
• A local-global principle for linear dependence of noncommutative polynomials.
• An application of the Cayley-Hamilton theorem to matrix polynomials in several variables
• An upper bound for the length of a finite-dimensional algebra
• Matrix inequalities: A symbolic procedure to determine convexity automatically
• On the lengths of irreducible pairs of complex matrices
• Quasi-identities on matrices and the Cayley-Hamilton polynomial.
• Word maps and Waring type problems.
• Words containing a basis for the algebra of all matrices
• Über die Gelfand-Kirillov-Dimension. (On the Gelfand-Kirillov-dimension)

Cited in

(4)

• An improved bound for the lengths of matrix algebras
• A proof of the Paz conjecture for \(6 \times 6\) matrices
• A resolution of Paz's conjecture in the presence of a nonderogatory matrix
• Graphs and Bergman's GK gap theorem

Describes a project that uses

Uses Software

• NCAlgebra

This page was built for publication: Sweeping words and the length of a generic vector subspace of \(M_n(\mathbb{F})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q530766)