Table of Contents
Fetching ...

Two conjectures in spectral hypergraph theory

Ya-Nan Zheng

TL;DR

The paper settles Fan's conjectures by linking algebraic multiplicities of spectral hypergraph tensors to sizes of projective eigenvarieties. It achieves this through a reduction to stochastic form via diagonal similarity, then employs Macaulay's resultant and Hilbert function machinery to show that the algebraic multiplicity of the spectral radius equals the number of eigenvectors in the corresponding projective variety, and that this equals the multiplicity of the zero Laplacian eigenvalue. This yields a computable framework: the Smith normal form of incidence matrices over $Z_k$ determines both the eigenvariety sizes and the multiplicities. The results extend to a variety of hypergraph classes and operations, providing explicit formulas and multiplicativity properties that enable practical calculation of these spectral invariants, with further simplifications when $k$ is prime.

Abstract

Let $\mathcal{A}$ be a $k$-th order $n$-dimensional tensor, and we denote by ${\rm am}(λ, \mathcal{A})$ the algebraic multiplicity of the eigenvalue $λ$ of $\mathcal{A}$. The projective eigenvariety $\mathbb{V}_λ(\mathcal{A})$ is defined as the set of eigenvectors of $\mathcal{A}$ associated with $λ$, considered in the complex projective space. For a connected uniform hypergraph $H$, let $\mathcal{A}(H)$ and $\mathcal{L}(H)$ denote its adjacency tensor and Laplacian tensor, respectively. Let $ρ$ be the spectral radius of $\mathcal{A}(H)$, for which it is known that $|\mathbb{V}_ρ(\mathcal{A}(H))| = |\mathbb{V}_{0}(\mathcal{L}(H))|$. Recently, Fan [arXiv:2410.20830v2, 2024] conjectured that ${\rm am}(ρ, \mathcal{A}(H)) = |\mathbb{V}_ρ(\mathcal{A}(H))|$ and ${\rm am}(0, \mathcal{L}(H)) = {\rm am}(ρ, \mathcal{A}(H))$. In this paper, we prove these two conjectures, and thereby establish $$ {\rm am}(ρ, \mathcal{A}(H)) = |\mathbb{V}_ρ(\mathcal{A}(H))| = |\mathbb{V}_{0}(\mathcal{L}(H))| = {\rm am}(0, \mathcal{L}(H)). $$ As shown by Fan et al., $|\mathbb{V}_ρ(\mathcal{A}(H))|$ and $|\mathbb{V}_{0}(\mathcal{L}(H))|$ can be computed via the Smith normal form of the incidence matrix of $H$ over $\mathbb{Z}_{k}$. Consequently, we provide a method for computing the algebraic multiplicity of the spectral radius and zero Laplacian eigenvalue for connected uniform hypergraphs.

Two conjectures in spectral hypergraph theory

TL;DR

The paper settles Fan's conjectures by linking algebraic multiplicities of spectral hypergraph tensors to sizes of projective eigenvarieties. It achieves this through a reduction to stochastic form via diagonal similarity, then employs Macaulay's resultant and Hilbert function machinery to show that the algebraic multiplicity of the spectral radius equals the number of eigenvectors in the corresponding projective variety, and that this equals the multiplicity of the zero Laplacian eigenvalue. This yields a computable framework: the Smith normal form of incidence matrices over determines both the eigenvariety sizes and the multiplicities. The results extend to a variety of hypergraph classes and operations, providing explicit formulas and multiplicativity properties that enable practical calculation of these spectral invariants, with further simplifications when is prime.

Abstract

Let be a -th order -dimensional tensor, and we denote by the algebraic multiplicity of the eigenvalue of . The projective eigenvariety is defined as the set of eigenvectors of associated with , considered in the complex projective space. For a connected uniform hypergraph , let and denote its adjacency tensor and Laplacian tensor, respectively. Let be the spectral radius of , for which it is known that . Recently, Fan [arXiv:2410.20830v2, 2024] conjectured that and . In this paper, we prove these two conjectures, and thereby establish As shown by Fan et al., and can be computed via the Smith normal form of the incidence matrix of over . Consequently, we provide a method for computing the algebraic multiplicity of the spectral radius and zero Laplacian eigenvalue for connected uniform hypergraphs.
Paper Structure (9 sections, 21 theorems, 52 equations)

This paper contains 9 sections, 21 theorems, 52 equations.

Key Result

Theorem 2.1

Fix degrees $d_1, \ldots, d_n$. For $i \in [n]$, consider all monomials $\mathbf{x}^{\alpha}$ of total degree $d_i$ in $x_1, \ldots, x_n$. For each such monomial, define a variable $u_{i,\alpha}$. Then there is a unique polynomial Res$\in \mathbb{Z}[\{u_{i,\alpha}\}]$ with the following three proper

Theorems & Definitions (28)

  • Definition 1.1: Lim05Qi05
  • Conjecture 1.2: Fan24
  • Conjecture 1.3: Fan24
  • Theorem 2.1
  • Theorem 2.2: CLO98Macaulay02
  • Theorem 2.3: BDM14
  • Definition 2.4: YY11
  • Theorem 2.5: YY11
  • Theorem 2.6: Minc88
  • Corollary 2.7
  • ...and 18 more