arxiv: 2604.23365 · v1 · submitted 2026-04-25 · 🧮 math.CO · math.SP

Recognition: unknown

Eigenvalues of Hypergraph Products and Reciprocal Eigenvalue Property

Shashwath S Shetty , K Arathi Bhat

Authors on Pith no claims yet

Pith reviewed 2026-05-08 07:41 UTC · model grok-4.3

classification 🧮 math.CO math.SP

keywords hypergraph eigenvaluesreciprocal eigenvalue propertyhypergraph productspower hypertreesadjacency hypermatrixLaplacian hypermatrixspectral hypergraph theory

0 comments

The pith

Power hypertrees fail to satisfy the reciprocal eigenvalue property after its extension to hypergraphs.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies how the eigenvalues of adjacency, Laplacian, and signless-Laplacian hypermatrices transform under the join, Kronecker, and corona products of hypergraphs. It extends the reciprocal eigenvalue property from graphs to hypergraphs, where this property captures symmetries in which eigenvalues appear in reciprocal pairs. The authors then show that power hypertrees do not possess this property. A reader would care because hypergraphs represent multi-way connections that ordinary graphs cannot capture, and knowing when their spectra lack expected symmetries affects the modeling of complex systems such as biological networks or social structures.

Core claim

The authors extend the reciprocal eigenvalue property to hypergraphs by applying it to the eigenvalues of adjacency, Laplacian, and signless-Laplacian hypermatrices, and they prove that power hypertrees do not satisfy the property. At the same time, they derive explicit relations showing how the spectra of the three product hypergraphs are determined by the spectra of the factor hypergraphs.

What carries the argument

The reciprocal eigenvalue property extended to hypergraphs, which requires that eigenvalues of the hypermatrices appear in reciprocal pairs reflecting spectral symmetry.

Load-bearing premise

That the reciprocal eigenvalue property from graphs carries over directly to hypergraphs by applying the same pairing condition to hypermatrix eigenvalues.

What would settle it

Compute all eigenvalues of the adjacency hypermatrix for a small explicit power hypertree and check whether each eigenvalue λ has a matching reciprocal 1/λ in the spectrum.

Figures

Figures reproduced from arXiv: 2604.23365 by K Arathi Bhat, Shashwath S Shetty.

**Figure 1.** Figure 1: Sub-hypertree T1 Case 2. A hyperedge attached to a non-pendent vertex of P (r) 3 , which is depicted in view at source ↗

**Figure 2.** Figure 2: Sub-hypertree T2 Suppose that T contains T1 as a sub-hypergraph, then ΦT (λ) contains (λ 2r − 4λ r + 3) as a factor, and hence 3 1 r as an eigenvalue of T . Even otherwise, if T contains T2 as an induced sub-hypergraph, then 3 1 r is an eigenvalue of T . Now by using the Rational Root Theorem, the proof concludes. 11 view at source ↗

read the original abstract

Spectral hypergraph theory has recently attracted considerable interest as it provides a natural framework for modeling higher-order relationships beyond classical graphs. In this setting, eigenvalues of adjacency, Laplacian, and signless-Laplacian hypermatrices play an important role in understanding the underlying structure of hypergraphs. In this work, we study the adjacency, Laplacian, and signless-Laplacian eigenvalues of the join, Kronecker, and corona products of hypergraphs, and examine how these spectra behave under such operations. These investigations help in better understanding the interplay between hypergraph structure and spectral properties. The reciprocal eigenvalue property is of particular interest due to the spectral symmetries it reflects. Motivated by this, we extend the notion of reciprocal eigenvalue property to hypergraphs and show that power hypertrees do not satisfy this property.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper extends the reciprocal eigenvalue property to hypergraphs and gives a negative result for power hypertrees, plus explicit spectral relations under three product operations.

read the letter

The main takeaway is that the authors generalize the reciprocal eigenvalue property to hypergraphs and show power hypertrees lack it, while also finding how eigenvalues behave under join, Kronecker, and corona products for adjacency, Laplacian, and signless-Laplacian hypermatrices. This extension appears new, and the negative result for power hypertrees is a concrete contribution. The product results are useful because they let you compute spectra of bigger hypergraphs from smaller ones without starting from scratch each time. The paper handles the product operations well. It seems to give clear relations between the eigenvalues of the product and those of the factors, at least for the cases they consider. That kind of explicit description is what makes spectral theory practical for building examples. One soft spot is the definition of the reciprocal property itself. For hypergraphs there could be multiple ways to define it, since the eigenvalue equations are of higher degree. The paper needs to pick one carefully, show it agrees with the usual graph version on ordinary graphs, and then demonstrate the failure for power hypertrees under that same definition. If the choice is not well motivated, the claim loses some force. The citation pattern looks standard for the area, drawing from spectral graph theory and recent hypergraph work. No obvious gaps there. This paper is for specialists in spectral hypergraph theory. A reader who already knows the graph versions of these products and the reciprocal property will get the most out of it, especially if they want to extend their own calculations to hypergraphs. It has enough substance to go to peer review. The product formulas can be verified directly, and the definition question is something referees can weigh in on. I would recommend sending it out rather than desk rejecting.

Referee Report

2 major / 2 minor

Summary. The manuscript studies the adjacency, Laplacian, and signless-Laplacian eigenvalues of hypergraphs under the join, Kronecker, and corona product operations. It extends the reciprocal eigenvalue property to the hypergraph setting and proves that power hypertrees fail to satisfy this property.

Significance. If the central claims hold under a well-defined extension, the work advances spectral hypergraph theory by clarifying how product constructions interact with hypermatrix spectra and by supplying a concrete family of hypergraphs without reciprocal symmetry. The explicit treatment of three distinct products and the focus on power hypertrees constitute a useful contribution provided the proofs are complete and the chosen definition is justified.

major comments (2)

[Section introducing the reciprocal eigenvalue property for hypergraphs] The extension of the reciprocal eigenvalue property to k-uniform hypergraphs is load-bearing for the non-satisfaction claim yet is not shown to be the unique or canonical generalization. The manuscript must state the precise definition (e.g., via the resultant of the eigenvalue system or the characteristic polynomial of the hypermatrix), prove that it reduces to the standard graph condition λ^n P(1/λ) = ±P(λ) when k=2, and then exhibit an explicit power hypertree whose spectrum violates the chosen reciprocity. Without this, the statement that power hypertrees “do not satisfy this property” remains dependent on an arbitrary choice of extension.
[Section on product operations and eigenvalue relations] The proofs that the spectra of the three product operations behave in the claimed manner are not accompanied by explicit formulas or small-case verifications. For the corona product, for instance, the relation between the eigenvalues of the product hypermatrix and those of the factors should be derived in closed form (analogous to the graph case) rather than asserted; the absence of such a derivation undermines the utility of the product results for the subsequent reciprocity analysis.

minor comments (2)

[Abstract] The abstract summarizes the topics studied but does not state the concrete spectral relations obtained for the products or the precise sense in which power hypertrees fail reciprocity; adding one sentence on each would improve readability.
[Preliminaries] Notation for hypermatrices (e.g., the distinction between adjacency, Laplacian, and signless-Laplacian hypermatrices) should be introduced once in a dedicated preliminary section and used consistently thereafter.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive suggestions, which will improve the clarity and rigor of the manuscript. We address each major comment below and have prepared revisions accordingly.

read point-by-point responses

Referee: [Section introducing the reciprocal eigenvalue property for hypergraphs] The extension of the reciprocal eigenvalue property to k-uniform hypergraphs is load-bearing for the non-satisfaction claim yet is not shown to be the unique or canonical generalization. The manuscript must state the precise definition (e.g., via the resultant of the eigenvalue system or the characteristic polynomial of the hypermatrix), prove that it reduces to the standard graph condition λ^n P(1/λ) = ±P(λ) when k=2, and then exhibit an explicit power hypertree whose spectrum violates the chosen reciprocity. Without this, the statement that power hypertrees “do not satisfy this property” remains dependent on an arbitrary choice of extension.

Authors: We agree that the definition requires explicit justification. In the revised manuscript we will state the reciprocal eigenvalue property for k-uniform hypergraphs via the characteristic polynomial of the associated hypermatrix (i.e., λ^n P(1/λ) = ±P(λ) where P is the characteristic polynomial). We will include a short proof that this definition recovers the classical graph condition when k=2. We will also supply a concrete small power hypertree (with its spectrum computed explicitly) that violates the relation, thereby grounding the non-satisfaction claim in a specific example rather than an arbitrary extension. revision: yes
Referee: [Section on product operations and eigenvalue relations] The proofs that the spectra of the three product operations behave in the claimed manner are not accompanied by explicit formulas or small-case verifications. For the corona product, for instance, the relation between the eigenvalues of the product hypermatrix and those of the factors should be derived in closed form (analogous to the graph case) rather than asserted; the absence of such a derivation undermines the utility of the product results for the subsequent reciprocity analysis.

Authors: We accept this criticism. The revised version will contain explicit closed-form expressions for the eigenvalues of the join, Kronecker, and corona products of hypermatrices, together with small-case verifications (e.g., 2-uniform and 3-uniform examples). For the corona product we will derive the precise relation between the spectrum of the product hypermatrix and the spectra of the factors, mirroring the standard graph derivation, so that the formulas can be used directly in the reciprocity analysis. revision: yes

Circularity Check

0 steps flagged

No circularity: extension and verification rest on explicit definitions and direct spectral computations

full rationale

The paper introduces an explicit generalization of the reciprocal eigenvalue property from graphs (spectrum closed under λ ↦ 1/λ) to hypergraphs via the adjacency, Laplacian, and signless-Laplacian hypermatrices. It derives eigenvalue relations under join, Kronecker, and corona products using standard hypermatrix operations, then verifies that power hypertrees fail the property by direct computation of their spectra. No step reduces a claimed prediction to a fitted input, renames a known result, or relies on a load-bearing self-citation whose content is itself unverified. The definition is stated outright rather than smuggled via prior work, and the non-satisfaction result follows from applying that definition to concrete hypergraphs without circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard definitions from spectral hypergraph theory; no free parameters, invented entities, or ad-hoc axioms are visible in the abstract.

axioms (2)

standard math Standard definitions of adjacency, Laplacian, and signless-Laplacian hypermatrices for hypergraphs.
Invoked throughout the study of eigenvalues under products.
domain assumption The join, Kronecker, and corona products are well-defined operations on hypergraphs that induce corresponding hypermatrix constructions.
Used to relate spectra of products to spectra of factors.

pith-pipeline@v0.9.0 · 5431 in / 1174 out tokens · 53010 ms · 2026-05-08T07:41:27.542364+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

29 extracted references · 1 canonical work pages

[1]

Spectra of graphs resulting from various graph op erations and products: a survey

Sasmita Barik, Deabajit Kalita, Sukanta Pati, and Gopin ath Sahoo. Spectra of graphs resulting from various graph op erations and products: a survey. Special Matrices, 6(1):323–342, 2018

2018
[2]

Spectra of uniform hyperg raphs

Joshua Cooper and Aaron Dutle. Spectra of uniform hyperg raphs. Linear Algebra and its applications , 436(9):3268–3292, 2012

2012
[3]

Eigenvalues on the adjacency ten sor of products of hypergraphs

K Pearson and Tan Zhang. Eigenvalues on the adjacency ten sor of products of hypergraphs. Int. J. Contemp. Math. Sci , 8(4):151–158, 2013

2013
[4]

A general product of tensors with applicati ons

Jia-Yu Shao. A general product of tensors with applicati ons. Linear Algebra and its applications , 439(8):2350–2366, 2013

2013
[5]

The spectrum o f the corona of two graphs

Sasmita Barik, Sukanta Pati, and BK Sarma. The spectrum o f the corona of two graphs. SIAM Journal on Discrete Mathematics , 21(1):47–56, 2007

2007
[6]

On no nsingular trees and a reciprocal eigenvalue property

Sasmitha Barik, Michael Neumann, and Sukanta Pati. On no nsingular trees and a reciprocal eigenvalue property. Linear and Multilinear Algebra, 54(6):453–465, 2006

2006
[7]

Unicyclic graphs with strong reciprocal eigenvalue prope rty

Sasmita Barik, Milan Nath, Sukanta Pati, and Bhaba Sarma . Unicyclic graphs with strong reciprocal eigenvalue prope rty. The Electronic Journal of Linear Algebra , 17:139–153, 2008

2008
[8]

On reciprocal eigenva lue property of weighted trees

Michael Neumann and Sukanta Pati. On reciprocal eigenva lue property of weighted trees. Linear Algebra and its Applications , 438(10):3817–3828, 2013

2013
[9]

On the inverse of a cl ass of bipartite graphs with unique perfect matchings

Swarup Kumar Panda and Sukanta Pati. On the inverse of a cl ass of bipartite graphs with unique perfect matchings. The Electronic Journal of Linear Algebra , 29:89–101, 2015

2015
[10]

Strong reciprocal eigenvalue property of a class of weighte d graphs

Ravindra B Bapat, Swarup Kumar Panda, and Sukanta Pati. Strong reciprocal eigenvalue property of a class of weighte d graphs. Linear Algebra and its Applications , 511:460–475, 2016

2016
[11]

Graphs with recipr ocal eigenvalue properties

Swarup Kumar Panda and Sukanta Pati. Graphs with recipr ocal eigenvalue properties. The Electronic Journal of Linear Algebra , 31:511–514, 2016

2016
[12]

Tre es with the reciprocal eigenvalue property

Sasmita Barik, Debabrota Mondal, and Sukanta Pati. Tre es with the reciprocal eigenvalue property. Linear and Multilinear Algebra , 70(21):6712–6717, 2022

2022
[13]

Singular graphs and the reciprocal eigenvalue p roperty

Sasmita Barik, Debabrota Mondal, Sukanta Pati, and Kul deep Sarma. Singular graphs and the reciprocal eigenvalue p roperty. Discrete Mathematics, 347(7):114003, 2024

2024
[14]

On some graphs whic h satisfy reciprocal eigenvalue properties

Swarup Kumar Panda and Sukanta Pati. On some graphs whic h satisfy reciprocal eigenvalue properties. Linear Algebra and its Applica- tions, 530:445–460, 2017

2017
[15]

Self-inverse unicyclic graphs and strong reciprocal eigen value property

Ravindra B Bapat, Swarup Kumar Panda, and Sukanta Pati. Self-inverse unicyclic graphs and strong reciprocal eigen value property. Linear Algebra and its Applications , 531:459–478, 2017

2017
[16]

On non-b ipartite graphs with strong reciprocal eigenvalue propert y

Sasmita Barik, Rajiv Mishra, and Sukanta Pati. On non-b ipartite graphs with strong reciprocal eigenvalue propert y. Linear Algebra and its Applications , 699:107–128, 2024

2024
[17]

Classes of directed graphs wit h reciprocal eigenvalue property

Feng Liu and Kaiyang Lan. Classes of directed graphs wit h reciprocal eigenvalue property. Southeast Asian Bulletin of Mathematics , 49(6), 2025

2025
[18]

Recip rocal eigenvalue properties using the zeta and m¨ obius func tions

Ganesh S Kadu, Gahininath Sonawane, and YM Borse. Recip rocal eigenvalue properties using the zeta and m¨ obius func tions. Linear Algebra and its Applications , 694:186–205, 2024

2024
[19]

Classes of nonbipartit e graphs with reciprocal eigenvalue property

Sasmita Barik and Sukanta Pati. Classes of nonbipartit e graphs with reciprocal eigenvalue property. Linear Algebra and its Applications , 612:177–187, 2021

2021
[20]

A reciprocal eigenval ue property for unicyclic weighted directed graphs with wei ghts from {± 1,± i}

Debajit Kalita and Sukanta Pati. A reciprocal eigenval ue property for unicyclic weighted directed graphs with wei ghts from {± 1,± i}. Linear Algebra and its Applications , 449:417–434, 2014

2014
[21]

Eigenvalues of a real supersymmetric tensor

Liqun Qi. Eigenvalues of a real supersymmetric tensor. Journal of symbolic computation , 40(6):1302–1324, 2005

2005
[22]

Singular values and eigenvalues of tenso rs: a variational approach

Lek-Heng Lim. Singular values and eigenvalues of tenso rs: a variational approach. In 1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005 , pages 129–132. IEEE, 2005

2005
[23]

Algorithm 862: Matlab t ensor classes for fast algorithm prototyping

Brett W Bader and Tamara G Kolda. Algorithm 862: Matlab t ensor classes for fast algorithm prototyping. ACM Transactions on Mathematical Software (TOMS) , 32(4):635–653, 2006

2006
[24]

Mathematics in Signal Processing V , chapter Tensor decompositions: state of the art and applic ations, pages 1–24

Pierre Comon. Mathematics in Signal Processing V , chapter Tensor decompositions: state of the art and applic ations, pages 1–24. Oxford University Press, 2002

2002
[25]

Tensor transpose and its properties

Ran Pan. Tensor transpose and its properties. arXiv preprint arXiv:1411.1503 , 2014

work page arXiv 2014
[26]

The forgotten inde x of hypergraphs and some hypergraph operations

Shashwath S Shetty and K Arathi Bhat. The forgotten inde x of hypergraphs and some hypergraph operations. Communications in Combinatorics and Optimization , 2025

2025
[27]

All eig envalues of the power hypergraph and signed subgraphs of a gr aph

Lixiang Chen, Edwin R van Dam, and Changjiang Bu. All eig envalues of the power hypergraph and signed subgraphs of a gr aph. Linear Algebra and its Applications , 676:205–210, 2023

2023
[28]

On a relationship be tween the characteristic and matching polynomials of a unif orm hypertree

Honghai Li, Li Su, and Shaun Fallat. On a relationship be tween the characteristic and matching polynomials of a unif orm hypertree. Discrete Mathematics , 347(5):113915, 2024

2024
[29]

Uniform hypertrees with maximum nullity

Ya-Nan Zheng. Uniform hypertrees with maximum nullity . Linear Algebra and its Applications , 730:138–151, 2026. 12

2026