The non-annihilating graph conjecture for Monster-type axial algebras
Statement
Let be an axial algebra of Monster-type with generating axes , and let be the graph whose vertices are the axes in , with distinct vertices adjacent exactly when . A sum decomposition is a decomposition into axial subalgebras, with distinct summands annihilating one another, and let be the axes contained in . Non-annihilating graph conjecture. The finest sum decomposition of arises when each is a single connected component of . This conjecture proposes that the connected components of the non-annihilating graph determine the finest sum decomposition; the supplied text gives no resolution status.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.