The characteristic polynomial of sunflowers
Changjiang Bu, Lixiang Chen, Ge Lin

TL;DR
This paper derives the eigenvalues and spectral moments of sunflowers, a special class of hypergraphs, providing an explicit formula for their characteristic polynomial.
Contribution
It introduces a method to compute the characteristic polynomial of sunflowers, advancing spectral hypergraph theory.
Findings
Explicit formula for the characteristic polynomial of sunflowers
Eigenvalues and spectral moments are determined
Spectral properties of sunflowers are characterized
Abstract
A uniform hypergraph is called a sunflower if all of its hyperedges intersect in the same set of vertices. In this paper, we determine the eigenvalues and spectral moments of a sunflower, thereby obtaining an explicit formula for its characteristic polynomial.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
