On a class of commutative algebras associated to graphs
Abstract: In 2004 Alexander Postnikov and Boris Shapiro introduced a class of commutative algebras for non-directed graphs. There are two main types of such algebras, algebras of the first type count spanning trees and algebras of the second type count spanning forests. These algebras have a number of interesting properties including an explicit formula for their Hilbert series. In this thesis we mainly work with the second type of algebras, we discover more properties of the original algebra and construct a few generalizations. In particular we prove that the algebra counting forests depends only on graphical matroid of the graph and converse. Furthermore, its "K-theoretic" filtration reconstructs the whole graph. We introduse $t$ labelled algebras of a graph, their Hilbert series contains complete information about the Tutte polynomial of the initial graph. Finally we introduce similar algebras for hypergraphs. To do this, we define spanning forests and trees of a hypergraph and the corresponding "hypergraphical" matroid.
CLICK HERE TO DOWNLOAD THE WHOLE DISSERTATION. (in PDF format)