Department of Mathematics

Combinatorics and Graph Theory

  •  Alexander Diaz-Lopez, Villanova University
  •  Arithmetical Structures on Graphs
  •  10/28/2020
  •  3:00 PM - 3:50 PM
  •  C517 Wells Hall (Virtual Meeting Link)
  •  Bruce E Sagan (bsagan@msu.edu)

Arithmetical structures on finite connected graphs are generalization of the Laplacian of a graph. Dino Lorenzini originally defined them in order to answer some questions in algebraic geometry, but more recently, they have been studied on their own, particularly with a combinatorics lens. In this talk, we will discuss how to count the number of arithmetical structures on different types of graphs and discuss why it is a hard but interesting question for other families. If time permits, we will talk about their corresponding critical groups.

 

Contact

Department of Mathematics
Michigan State University
619 Red Cedar Road
C212 Wells Hall
East Lansing, MI 48824

Phone: (517) 353-0844
Fax: (517) 432-1562

College of Natural Science