ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be an axial algebra of Monster-type with generating axes XX, and let Δ(X)\Delta(X) be the graph whose vertices are the axes in XX, with distinct vertices a,ba,b adjacent exactly when ab≠0ab\neq 0. A sum decomposition is a decomposition A=∑i∈IAiA=\sum_{i\in I}A_i into axial subalgebras, with distinct summands annihilating one another, and let Xi⊆XX_i\subseteq X be the axes contained in AiA_i. Non-annihilating graph conjecture. The finest sum decomposition of AA arises when each XiX_i is a single connected component of Δ(X)\Delta(X). 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.