Constructing cospectral hypergraphs
Aida Abiad, Antonina P. Khramova

TL;DR
This paper introduces a new method for constructing cospectral uniform hypergraphs using adjacency tensors and matrices, advancing understanding of spectral properties in hypergraph theory.
Contribution
It presents a novel approach to generate cospectral hypergraphs, highlighting the limitations of spectral methods in hypergraph property determination.
Findings
New construction method for cospectral hypergraphs
Utilizes adjacency tensors and matrices
Enhances understanding of spectral hypergraph properties
Abstract
Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be deduced from their spectra. In this paper, we show a new method for constructing cospectral uniform hypergraphs using two well-known hypergraph representations: adjacency tensors and adjacency matrices.
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.
Taxonomy
TopicsData Visualization and Analytics · Tensor decomposition and applications
