The KP–BSO compatibility conjecture for multilinear identities

About 15 years old · traced to

Let F\mathbb{F} be a coefficient field, let n≥2n\geq 2, and let ω\omega be a multilinear nn-ary operation in an associative algebra over F\mathbb{F}. Fix d≡1(modn−1)d\equiv 1\pmod{n-1}, and for 1≤e≤d1\leq e\leq d let IeI_e be the space of multilinear degree-ee identities of ω\omega, let KP⁡(Ie)\operatorname{KP}(I_e) be the result of applying the KP algorithm, and set

KP⁡d(ω)=⨁1≤e≤dKP⁡(Ie).\operatorname{KP}_d(\omega)=\bigoplus_{1\leq e\leq d}\operatorname{KP}(I_e).

Applying the BSO algorithm to ω\omega gives multilinear nn-ary operations ω1,…,ωn\omega_1,\dots,\omega_n in an associative dialgebra; let JeJ_e be their multilinear degree-ee identities and set

Jd(ω1,…,ωn)=⨁1≤e≤dJe.J_d(\omega_1,\dots,\omega_n)=\bigoplus_{1\leq e\leq d}J_e.

KP–BSO compatibility conjecture. If the field F\mathbb{F} has characteristic 00 or p>dp>d, then

KP⁡d(ω)=Jd(ω1,…,ωn).\operatorname{KP}_d(\omega)=J_d(\omega_1,\dots,\omega_n).

Equivalently, when the group algebra FSd\mathbb{F}S_d is semisimple, finding the identities of ω\omega and applying the KP algorithm gives the same result as applying the BSO algorithm and finding the identities of the resulting operations. The conjecture asserts compatibility of these two procedures for multilinear identities of nn-ary operations.

References

Primary source

Murray R. Bremner, Raul Felipe and Juana Sanchez-Ortega, “Jordan Triple Disystems”, arXiv:1105.5475 (2011).

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.