A general switching method for constructing E-cospectral hypergraphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914454009020416 |
|---|---|
| author | Abiad, Aida Cooper, Joshua Okur, Utku |
| author_facet | Abiad, Aida Cooper, Joshua Okur, Utku |
| contents | Spectral hypergraph theory studies the structural properties of a hypergraph that can be inferred from the eigenvalues and the eigenvectors of either matrices or tensors associated with it. In this paper we study the spectral indistinguishability in the hypergraph setting. We present a general switching method to construct uniform $E$-cospectral hypergraphs (hypergraphs with the same $E$-spectrum), and discuss some of its multiple applications. Our method not only provides a framework to unify the existing methods for obtaining $E$-cospectral hypergraphs via switching, but also generalizes most of the existing switching tools, yielding multiple new constructions. Finally, we compare common methods of computing $E$-characteristic polynomials, and in particular show that one standard method, while useful for generic tensors, is uninformative for almost all hypergraphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_06016 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A general switching method for constructing E-cospectral hypergraphs Abiad, Aida Cooper, Joshua Okur, Utku Combinatorics 05C65 (Primary) 15A18, 15A69 (Secondary) Spectral hypergraph theory studies the structural properties of a hypergraph that can be inferred from the eigenvalues and the eigenvectors of either matrices or tensors associated with it. In this paper we study the spectral indistinguishability in the hypergraph setting. We present a general switching method to construct uniform $E$-cospectral hypergraphs (hypergraphs with the same $E$-spectrum), and discuss some of its multiple applications. Our method not only provides a framework to unify the existing methods for obtaining $E$-cospectral hypergraphs via switching, but also generalizes most of the existing switching tools, yielding multiple new constructions. Finally, we compare common methods of computing $E$-characteristic polynomials, and in particular show that one standard method, while useful for generic tensors, is uninformative for almost all hypergraphs. |
| title | A general switching method for constructing E-cospectral hypergraphs |
| topic | Combinatorics 05C65 (Primary) 15A18, 15A69 (Secondary) |
| url | https://arxiv.org/abs/2604.06016 |