2015/09/29 by Nenashev, Gleb
#Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics
paper · doi:10.48550/arxiv.1509.08736
In this paper we consider the original and different generalizations of Postnikov-Shapiro algebra which enumerate forests and trees of graphs, see~\citePSh. Our main result is that the algebra counting forests depends only on graphical matroid and converse. Also we generalize algebras for a hypergraph. For this, we define spanning forests and trees of a hypergraph and the corresponding "hypergraphical" matroid. We present 3 different equivalent definitions of spanning forests and trees, which can be read independently from other parts of the paper.