On Postnikov-Shapiro Algebras and their generalizations
Gleb Nenashev · arXiv (Cornell University) · 2016
A.Postnikov and B.Shapiro introduced a class of commutative algebras which enumerate forests and trees of graphs. 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.