[Paper Review] Postnikov-Shapiro Algebras, Graphical Matroids and their generalizations

Gleb Nenashev|arXiv (Cornell University)|Sep 29, 2015

Advanced Topics in Algebra12 references3 citations

TL;DR

This paper establishes that Postnikov-Shapiro algebras counting spanning forests in graphs depend solely on the graphical matroid, not on the graph’s specific structure. It introduces three equivalent definitions of spanning trees and forests in hypergraphs, generalizing graphical matroids to hypergraphical matroids, and proves that the algebraic structure is determined by the bridge-free matroid, supporting a conjecture on isomorphism invariance under matroid equivalence.

ABSTRACT

In this paper we consider the original and different generalizations of Postnikov-Shapiro algebra which enumerate forests and trees of graphs, see~\cite{PSh}. 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.

Motivation & Objective

• To establish a direct algebraic link between Postnikov-Shapiro algebras and graphical matroids, showing that the algebra counting forests depends only on the matroid.
• To generalize the concept of spanning trees and forests from graphs to hypergraphs, extending the framework of matroid theory.
• To define and characterize a hypergraphical matroid through three equivalent formulations, enabling algebraic enumeration of hypergraph spanning structures.
• To propose and investigate a conjecture that isomorphism of Postnikov-Shapiro algebras for trees implies isomorphism of bridge-free matroids.

Proposed method

• Define two isomorphic Postnikov-Shapiro algebras: one as a quotient of a polynomial ring with generators raised to powers based on edge cuts, and another as a subalgebra of a Clifford algebra with vertex-based generators.
• Use the Tutte polynomial as a generating function for the Hilbert series of the algebras, linking algebraic dimensions to combinatorial counts of forests and trees.
• Introduce the concept of bridge-free matroid by removing all bridges from a graph, showing that the algebraic structure is invariant under such removal.
• Construct equivalent definitions of spanning trees in hypergraphs using cuts, vector configurations, and algebraic ideals, generalizing the graphical case.
• Prove that the algebra ${\cal C}_{G}^{T}$ is isomorphic to ${\cal B}_{G}^{T}$ via quotienting by an ideal generated by cut-related relations, preserving the matroid structure.
• Propose a generalization of $G$-parking functions to hypergraphs as a foundation for defining hypergraphical algebras, though a full construction remains open.

Experimental results

Research questions

• RQ1 Does the Postnikov-Shapiro algebra counting spanning forests depend only on the graphical matroid, independent of the graph’s specific edge-vertex configuration?
• RQ2 Can the notion of spanning trees and forests in graphs be naturally extended to hypergraphs using matroid-theoretic principles?
• RQ3 What are three equivalent algebraic and combinatorial definitions of spanning trees in hypergraphs that generalize the graphical case?
• RQ4 Is the isomorphism class of the Postnikov-Shapiro algebra for trees determined solely by the bridge-free matroid of the underlying hypergraph?
• RQ5 Can a consistent algebraic framework be developed for hypergraph spanning trees, analogous to the Postnikov-Shapiro construction for graphs?

Key findings

• The Postnikov-Shapiro algebras ${\cal B}_{G}^{F}$ and ${\cal C}_{G}^{F}$ are isomorphic, and their total dimension equals the number of spanning forests in $G$, with graded components counting forests by external activity.
• The Hilbert series of the tree-counting algebra ${\cal C}_{G}^{T}$ is given by $\mathcal{H}_{{\cal C}_{G}^{T}}(t) = T_{G}(1, \frac{1}{t}) \cdot t^{e(G)-v(G)+c(G)}$, directly linking the algebra to the Tutte polynomial.
• For connected graphs, the algebra ${\cal B}_{G}^{T}$ is isomorphic to ${\cal C}_{G}^{T}$, and its dimension equals the number of spanning trees in $G$.
• The algebra ${\cal B}_{G}^{T}$ depends only on the bridge-free matroid of $G$, and isomorphism of such algebras implies isomorphism of bridge-free matroids, supporting a conjecture on matroid reconstruction.
• The paper constructs three equivalent definitions of hypergraph spanning trees via cuts, vector configurations, and algebraic ideals, generalizing the graphical matroid to hypergraphs.
• A generalization of $G$-parking functions to hypergraphs is proposed as a necessary step toward defining a full algebraic structure for hypergraph spanning trees, though a complete construction remains open.