ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An nn-nucleus is a minimal graph whose nn-braid group is not a right-angled Artin group, whereas the nn-braid group of every graph contained in it is a right-angled Artin group. Nuclei classification conjecture. There are exactly four 44-nuclei, as shown in Figure~, and exactly ten 33-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 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.