The chip-firing game is a simple game with only one move. Starting with a collection of poker chips on the vertices of a graph, one is allowed to move them around the graph using what is known as the "chip-firing move". A version of this game can be found here. Despite its simplicity, this game has deep connections to dynamics, number theory, and algebraic geometry.
The gonality of a graph is the smallest number of chips required so that the chip-firing game is always winnable. In this project, we will compute the gonality of a well-known family of graphs, the hypercubes.
The gonality of graphs has attracted recent interest, due to its connection to the geometry of algebraic curves. This specific family of graphs is related to complete intersections of quadrics.
Comments
Post a Comment