- Series
- Combinatorics Seminar
- Time
- Friday, September 7, 2018 - 3:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Joshua Cooper – University of South Carolina – http://people.math.sc.edu/cooper/
- Organizer
- Lutz Warnke
We give a complete description of the coefficients of the characteristic polynomial $\chi_H(\lambda)$ of a ($k$-uniform) hypergraph $H$, defined by the hyperdeterminant $\det(\mathcal{A} - \lambda \mathcal{I})$, where $\mathcal{A}$ is of the adjacency tensor/hypermatrix of $H$, and the hyperdeterminant is defined in terms of resultants of homogeneous systems associated to its argument. The co-degree $k$ coefficients can be obtained by an explicit formula yielding a linear combination of subgraph counts in $H$ of certain ``Veblen hypergraphs''. This generalizes the Harary-Sachs Theorem for graphs, provides hints of a Leibniz-type formula for symmetric hyperdeterminants, and can be used in concert with computational algebraic methods to obtain the full characteristic polynomial of many new hypergraphs, even when the degrees of these polynomials is enormous. Joint work with Greg Clark of USC.