加载中…
Given a collection P of k^2 commutative polynomials in 2k^2 commutative variables, the objective is to find a condensed representation of these polynomials in terms of a single non-commutative polynomial p(X,Y) in two k x k matrix variables X and Y. Algorithms that will generically determine whether the given family P has a non-commutative representation and that will produce such a representation are developed. These algorithms will determine a non-commutative representation for families P that admit a a non-commutative representation in an open, dense subset of the vector space of non-commutative polynomials in two variables.

生成讲解博客的中文版本

生成AI智能校验的中文版本