The KP–BSO compatibility conjecture for multilinear identities
The KP–BSO compatibility conjecture for multilinear identities
Let be a coefficient field, let , and let be a multilinear -ary operation in an associative algebra over . Fix , and for let be the space of multilinear degree- identities of , let be the result of applying the KP algorithm, and set
Applying the BSO algorithm to gives multilinear -ary operations in an associative dialgebra; let be their multilinear degree- identities and set
KP–BSO compatibility conjecture. If the field has characteristic or , then
Equivalently, when the group algebra is semisimple, finding the identities of 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 -ary operations.
Sources & referencesView supporting material
Primary source
Murray R. Bremner, Raul Felipe and Juana Sanchez-Ortega, “Jordan Triple Disystems”, arXiv:1105.5475 (2011).
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.