Bremner–Felipe–Sánchez-Ortega conjecture relating the KP and BSO algorithms
Bremner–Felipe–Sánchez-Ortega conjecture relating the KP and BSO algorithms
Let be a field, let be a multilinear -ary operation over , and fix a degree . For , let be the multilinear degree- subspace of the free nonassociative -ary algebra on generators, and let consist of the polynomial identities satisfied by . Let be the multilinear degree- subspace of the free nonassociative algebra with operations of arity , and let be obtained by applying the KP algorithm. Define
Applying the BSO algorithm to gives multilinear -ary operations . Let be the polynomial identities satisfied by these operations, and define
Bremner–Felipe–Sánchez-Ortega conjecture. If has characteristic or , then
The conjecture asserts that applying the KP algorithm to the identities of and directly computing the identities of the operations produced by the BSO algorithm give the same result. The characteristic assumption ensures the relevant group algebra is semisimple; the conjecture is presented as an open problem concerning the compatibility of these two constructions.
Sources & referencesView supporting material
Primary source
Murray R. Bremner, “Algebras, dialgebras, and polynomial identities”, arXiv:1201.3379 (2012).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.