Regular simplex tensors: optimization landscape, conjecture proof, and beyond

Abstract

The concept of tensor eigenpairs has attracted increasing research attention in the past decades. Recent works have focused on a special class termed regular simplex tensors, which are constructed from an equiangular tight frame of n vectors in (n-1) dimensional space for n >= 3 and order m >= 3. Existing works focus on analyzing the robustness of eigenpairs obtained by the tensor power method. At the end of that work, a conjecture was made that if they exist, the only robust eigenvectors of a regular simplex tensor, up to sign equivalence, are the vectors in the regular simplex frame. A subsequent study theoretically proved that this holds for the simplest triangle case where n = 3. However, for cases with higher n, the process becomes complicated in both checking all eigenpairs and determining the explicit formula for the robustness criterion. In this paper, to deal with this issue, a connection between robust and locally optimal eigenpairs is built, recognizing the latter as another pivotal concept in the field of optimization. Then, we turn to checking the local optimality of all eigenpairs, for which we have developed an efficient model with a favorable structure that facilitates the enumeration of all eigenpairs and delineates the optimization landscape for the model. Then, integrating the two advances enables us to narrow the scope of the robust eigenpairs to those locally maximized ones, which are exactly the vectors in the regular simplex frame. Finally, the proof of the conjecture reduces to only examining the vectors in the frame, whose robustness can be easily checked for any higher n and m. This work shows that, up to sign equivalence, excluding the exceptional cases (m, n) = (3, 3)/(3, 4)/(4, 3) where no robust eigenpairs exist, the only robust eigenvectors of a regular simplex tensor are the vectors in the regular simplex frame.

Minimal central slices of the regular simplex
Gergely Ambrus, Barnabás Gárgyán
arXiv22 Sep 2026PreprintarXiv licenceFull textAnalysis & PDEs Geometry & topologyarXiv
Stability of Hyperplane Projections of the Regular Simplex and L_p-Projection Bodies of balls in ℓ_qⁿ(ℝ)
Jacek Jakimiuk, Christos Pandis
arXiv16 Oct 2026PreprintarXiv licenceFull textGeometry & topologyarXiv
The Erdős--Chvátal Simplex Conjecture
Jing Huang
arXiv13 Sep 2026PreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
Stochastic Domination of Gaussian Maxima by the Regular Simplex
Abhijeet Mulgund
arXiv27 Sep 2026PreprintarXiv licenceFull textGeometry & topology ProbabilityarXiv
The Keevash--Mubayi simplex-cluster conjecture
Yongjiang Wu, Lihua Feng
arXiv6 Oct 2026PreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{wang2026regular,
  title = {{Regular simplex tensors: optimization landscape, conjecture proof, and beyond}},
  author = {Lei Wang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.34197},
  eprint = {2609.34197},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.34197},
  note = {CC BY-NC-SA 4.0},
}

RIS

TY  - UNPB
TI  - Regular simplex tensors: optimization landscape, conjecture proof, and beyond
AU  - Lei Wang
PY  - 2026
DA  - 2026/09/28
PB  - arXiv
DO  - 10.48550/arxiv.2609.34197
UR  - https://arxiv.org/abs/2609.34197
AB  - The concept of tensor eigenpairs has attracted increasing research attention in the past decades. Recent works have focused on a special class termed regular simplex tensors, which are constructed from an equiangular tight frame of n vectors in (n-1) dimensional space for n >= 3 and order m >= 3. Existing works focus on analyzing the robustness of eigenpairs obtained by the tensor power method. At the end of that work, a conjecture was made that if they exist, the only robust eigenvectors of a regular simplex tensor, up to sign equivalence, are the vectors in the regular simplex frame. A subsequent study theoretically proved that this holds for the simplest triangle case where n = 3. However, for cases with higher n, the process becomes complicated in both checking all eigenpairs and determining the explicit formula for the robustness criterion. In this paper, to deal with this issue, a connection between robust and locally optimal eigenpairs is built, recognizing the latter as another pivotal concept in the field of optimization. Then, we turn to checking the local optimality of all eigenpairs, for which we have developed an efficient model with a favorable structure that facilitates the enumeration of all eigenpairs and delineates the optimization landscape for the model. Then, integrating the two advances enables us to narrow the scope of the robust eigenpairs to those locally maximized ones, which are exactly the vectors in the regular simplex frame. Finally, the proof of the conjecture reduces to only examining the vectors in the frame, whose robustness can be easily checked for any higher n and m. This work shows that, up to sign equivalence, excluding the exceptional cases (m, n) = (3, 3)/(3, 4)/(4, 3) where no robust eigenpairs exist, the only robust eigenvectors of a regular simplex tensor are the vectors in the regular simplex frame.
ER  -

Abstract

Related

Cite