David E Speyer

Learn More
Barot, Geiss and Zelevinsky define a notion of a " cyclically orientable graph " and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky's work leaves open the question of giving an efficient characterization of cyclically orientable graphs. In this paper, we give a simple recursive description of cyclically(More)
  • 1