The commutation conjecture for generic commuting matrix equations

About 13 years old · traced to

Let KK be a field, let gg be a nonzero polynomial in the noncommuting indeterminates u1,…,uk+1u_1,\ldots,u_{k+1} such that

g(u1,…,uk,0)=0,g(u_1,\ldots,u_k,0)=0,

for every i≤ki\leq k, the indeterminate uiu_i appears exactly once in gg, and the degree of gg with respect to uiu_i is 11. Let A1,…,Ak,BA_1,\ldots,A_k,B be generic commuting n×nn\times n matrices, and consider

g(A1,…,Ak,X)+B=0ng(A_1,\ldots,A_k,X)+B=0_n

in the unknown X∈Mn(K‾)X\in\mathcal{M}_n(\overline{K}). The commutation conjecture. Every solution XX commutes with each AiA_i and with BB. Numerical experiments, including experiments for a quartic equation when n=3n=3, suggest this statement, but the supplied text does not establish it in general.

References

Primary source

Gerald Bourgeois, “Nonsymmetric generic matrix equations”, arXiv:1304.2506 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.