The four- and three-nuclei classification conjecture
Statement
An -nucleus is a minimal graph whose -braid group is not a right-angled Artin group, whereas the -braid group of every graph contained in it is a right-angled Artin group. Nuclei classification conjecture. There are exactly four -nuclei, as shown in Figure~, and exactly ten -nuclei, as shown in Figure~. This is a proposed finite classification of the exceptional graphs for braid indices four and three; the source gives no resolution beyond presenting the conjecture and the indicated figures.
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.