Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 18 min ago
PreprintCC BY-NC-ND 4.0arXiv

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

  • Yohji Akama
Open at sourcePDFDOICite

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 n-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.

Related

  1. Independence polynomials and the weak Lefschetz property for tadpole graphs
    Tran Quang Hoa, Nguyen Duy Phuoc, Tran Nguyen Thanh Son
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. The Non-Lefschetz Locus of Monomial Complete Intersections in Positive Characteristic
    Adam LaClair
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. Lefschetz Properties of complete intersesctions and maximal variation of hyperplane sections
    Mats Boij, Juan C. Migliore, Rosa M. Miró-Roig +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Lefschetz properties for monomial complete intersections
    Annet Kyomuhangi, Emanuela Marangone, Claudiu Raicu +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Two conjectures on the cospectrality of complete tripartite graphs are false
    Irena M. Jovanović, Jelena Sedlar, Riste Škrekovski
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{akama2026strong,
  title = {{Strong Lefschetz property of the Kirchhoff algebra of the complete tripartite graph $K_1,1,n$}},
  author = {Yohji Akama},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.21217},
  eprint = {2610.21217},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21217},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Strong Lefschetz property of the Kirchhoff algebra of the complete tripartite graph K_1,1,n
AU  - Yohji Akama
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.21217
UR  - https://arxiv.org/abs/2610.21217
AB  - 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 n-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.
ER  -