State graphs and fibered state surfaces

Abstract

Associated to every state surface for a knot or link is a state graph, which embeds as a spine of the state surface. A state graph can be decomposed along cut-vertices into graphs with induced planar embeddings. Associated with each such planar graph is a checkerboard surface, and each state surface is a fiber if and only if all of its associated checkerboard surfaces are fibers. We give an algebraic condition that characterizes which checkerboard surfaces are fibers directly from their state graphs. We use this to classify fibering of checkerboard surfaces for several families of planar graphs, including those associated with $2$–bridge links. This characterizes fibering for many families of state surfaces.