3 problems
N-regularity conjecture. Every vertex of the underlying undirected graph of has degree ; equivalently, the graph is -regular.
Let be a closed surface notation used in the paper, let be the rank, and let map to the dosp mutation graph via the map…
A positive braid word is a word in the braid generators with only positive exponents, and its mutation graph has vertices given by equivalence classes of Demazure weaves and edges…