Papers
Topics
Authors
Recent
Search
2000 character limit reached

Strong Lefschetz property of the Kirchhoff algebra of the complete tripartite graph K1,1,nK_{1,1,n}

Published 15 Oct 2026 in math.CO and math.AC | (2610.21217v1)

Abstract: By Whitney's 2-isomorphism theorem, the cycle matroids of two graphs are isomorphic if and only if one graph can be transformed into the other by finitely many applications of two operations: separation or identification at a cut-vertex, and twisting. The complete tripartite graph whose vertex set is the disjoint union of two singletons and an nn-element set is invariant, up to isomorphism, under these operations. In this paper we prove that the Macaulay inverse system (the Kirchhoff algebra) determined by the basis generating polynomial of the cycle matroid of such a graph has the strong Lefschetz property over a field of characteristic $0$. The proof reduces the non-degeneracy of the higher Hessians to the ranks of disjointness matrices of families of subsets (the Gottlieb--Wilson theorem) and to the representation theory of the symmetric group in relation to the Johnson scheme.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.