ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph Γ\Gamma and a braid index n≥2n\geq 2, let BnΓB_n\Gamma denote its graph braid group. An nn-nucleus is a minimal graph whose nn-braid group is not a right-angled Artin group, while the nn-braid group of every graph contained in it is a right-angled Artin group. Nucleus characterization conjecture. For every braid index n≥2n\geq 2, a graph Γ\Gamma contains no nn-nuclei if and only if BnΓB_n\Gamma is a right-angled Artin group. The paper proves this equivalence for n≥5n\geq 5 and conjectures that it holds for all braid indices.

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.