Pith. sign in

REVIEW 4 major objections 5 minor 26 references

Lexicographical ordering by spectral moments of bicyclic hypergraphs

T0 review · 4 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper pins down the extremal hypergraphs in the spectral-moment order of linear bicyclic uniform hypergraphs.

desk verdict A useful but incomplete extension of S-order to linear bicyclic hypergraphs; the central theorem as stated omits a large admissible parameter range. read the letter →

arxiv 2506.11907 v1 pith:F3S6RHZX submitted 2025-06-13 math.CO

Hong Zhou , Changjiang Bu This is my paper
classification math.CO MSC 05C6515A18
keywords spectralmomentsS-orderbicyclichypergraphsuniformadjacencytensorZagrebindexgirthlexicographicordering
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper determines the extremal members of the S-order—the lexicographic order induced by comparing spectral moments $S_d(H)$—among all linear bicyclic $k$-uniform hypergraphs with a fixed number of vertices, edges, and girth, for $k \ge 3$. The authors first show that only moments whose order is a multiple of $k$ can distinguish such hypergraphs: $S_d = 0$ whenever $k \nmid d$, so the first nontrivial moment is $S_{2k}$, which turns out to be an increasing function of the Zagreb index. They then prove that the last hypergraph in the order is the one with maximum Zagreb index, obtained by concentrating all pendant edges at a single vertex of a two-cycle structure, and that the first hypergraph is one of two explicit $B^k_{3,n,g,\cdot,\cdot}$ constructions, depending on whether the edge count $m$ is $2t+g-3$ or $2t+g-2$. A complete S-order of this family would let one compare all such hypergraphs by their full eigenvalue spectra.

What carries the argument

The load-bearing object is the spectral-moment formula $S_d(H)=d(k-1)^n \sum_{F\in\mathcal{F}^\epsilon_d(H)} \tau(F)/\prod_{v\in V(F)} d^+_v(F)$ (Equation (2.1)), which expresses each moment as a weighted count of Eulerian rooted-edge multisets. The paper evaluates it for $d=2k$ and $d=3k$, obtaining $S_{2k}$ in terms of the numbers of 1-edge and 2-edge paths ($P_1^{(k)}$, $P_2^{(k)}$), and $S_{3k}$ in terms of $P_1^{(k)}, P_2^{(k)}, P_3^{(k)}, S_3^{(k)}, C_3^{(k)}$; since $P_2^{(k)}$ counts reduce to the Zagreb index $M(H)$, the order is controlled by Zagreb index at the first level and by subhyperpath counts at later levels. The proofs use the operation of moving a pendant path from one vertex to another, which decreases or preserves the relevant subhypergraph counts, plus an assumed classification of linear bicyclic $k$-uniform hypergraphs into the families $\mathcal{B}^k_n$ and $\mathcal{C}^k_n$.

What would settle it

Find a linear bicyclic $k$-uniform hypergraph with $n=m(k-1)-1$ and girth $g$ that is not isomorphic to any $B^k_{i,n,p,l,q}$ or $C^k_{i,n,p,q,l}$; or, failing that, compute $S_{2k}$ and $S_{3k}$ for a candidate hypergraph in the claimed families and exhibit one whose spectral-moment vector sorts against the theorem's first or last hypergraph.

Watch

Extended reading notes

Core claim

Stated on the paper's own terms: for $k\ge 3$, among all linear bicyclic $k$-uniform hypergraphs on $n$ vertices with $m$ edges and girth $g$, the lexicographic order by spectral moments has explicit extremal hypergraphs. The last hypergraph is $C^k_{1,n,g/2,g/2,g/2}(m-3g/2)$ when $g$ is even and $C^k_{2,n,\lfloor g/2\rfloor,\lceil g/2\rceil,\lfloor g/2\rfloor}(m-g-\lfloor g/2\rfloor)$ when $g$ is odd (Theorem 3.1). The first hypergraph is $B^k_{3,n,g,t-4,t+1}$ when $m=2t+g-3$ with $t>g+1$, and $B^k_{3,n,g,t-3,t+1}$ when $m=2t+g-2$ with $t\ge g+1$ (Theorem 3.4). In both cases the identification is made by showing that all smaller-order spectral moments agree on the whole family, so the order is decided by the $2k$-th moment (for the last) or by a later multiple-of-$k$ moment (for the first), and then comparing counts of short subhypergraphs.

Load-bearing premise

The entire enumeration of candidates rests on the unproved assertion in Section 2 that every linear bicyclic $k$-uniform hypergraph belongs to one of the two families $\mathcal{B}^k_n$ or $\mathcal{C}^k_n$ with the stated parameter ranges.

Editorial extensions

If this is right

  • Within the family of linear bicyclic $k$-uniform hypergraphs with fixed $n,m,g$, every pair of hypergraphs can now be compared by spectral moments: the lexicographic order begins at the stated $B^k_{3,n,g,\cdot,\cdot}$ hypergraph and ends at the stated $C^k$ hypergraph.
  • Since $S_{2k}$ strictly increases with the Zagreb index, the last hypergraph in the S-order is exactly the one that maximizes the Zagreb index, matching the extremal hypergraphs of Lemma 2.7.
  • The vanishing result $S_d=0$ for $k\nmid d$ implies that the spectra of linear bicyclic $k$-uniform hypergraphs are $k$-symmetric, so any spectral invariant built from moments only sees multiples of $k$ in this family.
  • The first hypergraph is determined by minimizing the count of long subhyperpaths $P_t^{(k)}$ (and, at threshold cases, also comparing $C_t^{(k)}$, $Q_t$, $W_t$ counts), giving a concrete combinatorial description of the spectral extremal shape.
  • Combining Theorems 3.1 and 3.4 with the classification of $\mathcal{B}^k_n\cup \mathcal{C}^k_n$ yields the complete first/last pair for every admissible $(n,m,g)$ with $k\ge 3$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the classification of linear bicyclic $k$-uniform hypergraphs into $\mathcal{B}^k_n\cup\mathcal{C}^k_n$ is exhaustive—the paper asserts this without proof—then the same first/last identification would apply to every linear bicyclic hypergraph; a missing family would only narrow the theorems to the classes actually considered.
  • The same moment-comparison strategy (zeroing non-multiples of $k$, then comparing $S_{2k}$ via Zagreb index, then higher multiples via subhypergraph counts) is likely to extend to other classes of $k$-uniform hypergraphs with a known structure, such as tricyclic or cactus-like hypergraphs, where extremal Zagreb indices are already known.
  • Because $S_d$ is the $d$-th power sum of eigenvalues, the S-order extremal hypergraphs identified here are natural candidates for extremal spectral radius within the same family; the paper does not itself prove that spectral radius follows the S-order.
  • Testable extension: compute the first few spectral moments numerically for small $k,n,m,g$ and verify that the listed $B^k$ and $C^k$ hypergraphs sort as stated; this would also expose any hidden dependence on $k$ in the parameter ranges.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper studies the lexicographic ordering by spectral moments (S-order) of linear k-uniform bicyclic hypergraphs with fixed numbers of vertices and edges and fixed girth. It proves that S_d vanishes when k does not divide d, derives formulas for S_{2k} and S_{3k} in terms of counts of small subhypergraphs, and then identifies the last hypergraph (Theorem 3.1) and candidate first hypergraphs within the B-family (Theorem 3.2), within the C-family (Theorem 3.3), and among all linear bicyclic hypergraphs (Theorem 3.4). The main claimed contribution is the complete first/last characterization announced in the abstract.

Significance. If the announced result were complete, it would be a substantial extension of the classical graph S-order results to uniform hypergraphs and would connect spectral moments to the Zagreb index in a nontrivial way. The derivation of S_{2k} and S_{3k} from the trace formula, the reduction of S_{2k} to the Zagreb index, and the moving-pendant-path arguments are genuine contributions. However, the central theorem is currently incomplete, and the paper relies on an unproved classification and on extremal Zagreb lemmas imported from a companion preprint; these issues must be resolved before the main claim can be accepted.

major comments (4)
  1. [Theorem 3.4] The displayed statement of Theorem 3.4 covers only m = 2t + g - 3 with t > g+1 and m = 2t + g - 2 with t >= g+1. For girth g >= 3 this leaves admissible values such as m = 2g, 3g-4, 3g-3, and 3g-2 (m >= 2g is already the hypothesis of Theorem 3.1). The proof never handles these cases: it uses thresholds like m > 8, m > 11, m > 12, and m-g-q > t-4, so for infinitely many (g,m) the theorem returns no candidate. Consequently the abstract's unqualified claim to give the first hypergraph for every linear bicyclic k-uniform hypergraph with given girth and number of edges is not established as stated.
  2. [Section 2, classification paragraph] The assertion that all linear bicyclic k-uniform hypergraphs consist exactly of the two families B^k_n and C^k_n is stated without proof or citation. Every theorem's enumeration of candidate hypergraphs relies on this classification; if the classification is incomplete or the parameter ranges are incorrect, the identified first and last hypergraphs may only be extrema within a subclass. A proof or a complete reference for this classification should be supplied.
  3. [Lemmas 2.7-2.8 and the proofs of Theorems 3.1-3.4] The extremal Zagreb-index results are imported from the authors' companion preprint arXiv:2506.08875, which is not peer-reviewed and is not reproduced here. Theorems 3.1, 3.2, and 3.3 reduce the first significant spectral moment directly to these lemmas, so the paper's main conclusions depend on the correctness of that external result. The authors should either include proofs of Lemmas 2.7 and 2.8 or otherwise make this dependence independently verifiable.
  4. [Theorem 3.2 and Theorem 3.4, higher-order moment comparisons] Several comparisons use spectral moments of order 4k, gk, and tk without a general formula for S_{rk}; instead the text asserts equality of many subhypergraph counts and then gives only difference formulas. For example, in the proof of Theorem 3.2 the statement that all hypergraphs in a set have equal S_{dk} for d up to 4k-1 is asserted without demonstration, and the subsequent S_{4k} comparison uses counts of P_4, W_4, Q_4, and C_4 without deriving the coefficients. These assertions are load-bearing for the extremal conclusions and should be supported by explicit counting arguments or a general expression for S_{rk}.
minor comments (5)
  1. [Lemma 2.3 proof] The notation is inconsistent: the proof uses expressions such as C3_2,n,1,2,1 and C4_3,n,p,1,l where the superscript should presumably be k or an explicit integer; this makes the case analysis hard to follow.
  2. [Throughout] There are many grammatical and typographical issues, including 'hypercyle' for 'hypercycle', missing spaces in displayed formulas, and inconsistent use of 'S-order' versus 'S order'. The paper would benefit from a careful copyedit.
  3. [Section 2] The term 'k-uniform hypercycle' is used repeatedly but never defined; a precise definition (including the parameter p and the allowed intersections) should be given before the B^n and C^n constructions.
  4. [Abstract and introduction] The abstract says 'uniform hypergraphs' without stating k >= 3 or the linearity condition; the introduction already makes these restrictions clear, but the abstract should match the body.
  5. [References] Reference [25] is an arXiv preprint by the same authors; if the results of that preprint are essential, the manuscript should state their status clearly when citing them.

Circularity Check

0 steps flagged · score 1.0 of 10

No definitional or fitted-input circularity; the main derivation is internal, with only a load-bearing-but-independent self-citation to the authors' companion Zagreb paper and a statement-level coverage gap.

full rationale

The paper's derivation chain is not circular. Lemma 2.3 derives vanishing of spectral moments for k ∤ d from k-partiteness/hm-bipartiteness and the cited k-symmetry fact, and Lemmas 2.4 and 2.5 are computed from the external trace formula (2.1). Theorem 3.1 uses Lemma 2.4 plus identity (2.2) to make S_{2k} a strictly increasing affine function of the Zagreb index and invokes Lemma 2.7 from the authors' companion preprint [25] for the extremal Zagreb hypergraph. That self-citation concerns a different invariant, not a restatement of the S-order theorem, and the affine reduction is proved inside the paper, so it is not circular. Theorem 3.2 is a combinatorial comparison of subhypergraph counts internal to the paper, and Theorem 3.4 continues those comparisons. The main caveats are not circularity: the classification of all linear bicyclic k-uniform hypergraphs into the B/C families is asserted without proof or citation, and Theorem 3.4's displayed cases omit small admissible m (for example m = 2g, 3g - 4, and 3g - 2), so the abstract's unconditional first-hypergraph claim is incomplete as stated. Those are correctness and statement gaps, not constructional circularity. No fitted parameters are used and no prediction reduces to an input by construction.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper introduces no fitted parameters or new entities. Its central claim rests on the trace formula, an unproved classification of bicyclic hypergraphs, the k-symmetry vanishing result, and extremal Zagreb bounds taken from a same-author companion preprint.

assumptions (4)
  • standard math General trace formula S_d(H)=d(k-1)^n sum_{F in F_epsilon^d} tau(F)/prod d+_v(F) from [19].
    Equation (2.1) is stated without proof and is the basis for all moment formulas in the paper.
  • domain assumption Classification of all linear bicyclic k-uniform hypergraphs into B^k_n and C^k_n families.
    Section 2 asserts the classification without proof or citation; Lemma 2.3 and all extremal arguments rely on it.
  • standard math If a hypergraph spectrum is k-symmetric and k does not divide d, then S_d(H)=0.
    Lemma 2.2 from [18] is used to show that moments with index not divisible by k vanish.
  • ad hoc to paper Extremal Zagreb results for linear bicyclic hypergraphs from companion paper [25].
    Lemmas 2.7 and 2.8 are imported from the authors' companion preprint and are not derived or independently verified in this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Lexicographical ordering by spectral moments of bicyclic hypergraphs." pith.science (2026). https://pith.science/paper/F3S6RHZX

@misc{pith2026250611907,
  author       = {Pith},
  title        = {Pith review of: Lexicographical ordering by spectral moments of bicyclic hypergraphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/F3S6RHZX}},
  note         = {Machine review of arXiv:2506.11907}
}
abstract

For bicyclic hypergraphs, ordering by spectral moment ($S$-order) is investigated in this paper. We give the first and last hypergraphs in an $S$-order of linear bicyclic uniform hypergraphs with given girth and number of edges.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

26 extracted references · 15 canonical work pages

  1. [1]

    L. Qi. Eigenvalues of a real supersymmetric tensor. J. Symbolic Comput. , 40(6):1302–1324, 2005

    2005

  2. [2]

    Cooper and A

    J. Cooper and A. Dutle. Spectra of uniform hypergraphs. Linear Algebra Appl., 436(9):3268–3292, 2012

    2012

  3. [3]

    Zhou and C

    H. Zhou and C. Bu. Lexicographical ordering of hypergraphs via spectral mo- ments. Available at arXiv: 2309.16925

    arXiv

  4. [4]

    Cvetkovi´ c and M

    D. Cvetkovi´ c and M. Petri´ c. A table of connected graphs on six vertices.Dis- crete Math., 50:37–49, 1984. 22

    work page 1984

  5. [5]

    Cvetkovi´ c and P

    D. Cvetkovi´ c and P. Rowlinson. Spectra of unicyclic graphs. Graphs Comb. , 3:7–23, 1987

    work page 1987

  6. [6]

    Wu and Q

    Y. Wu and Q. Fan. On the lexicographical ordering by spectral moments of bicyclic graphs. Ars Comb., 114:213–222, 2014

    work page 2014

  7. [7]

    Wu and H

    Y. Wu and H. Liu. Lexicographical ordering by spectral moments of trees with a prescribed diameter. Linear Algebra Appl., 433:1707–1713, 2010

    work page 2010

  8. [8]

    X. Pan, X. Hu, X. Liu, and H. Liu. The spectral moments of trees with given maximum degree. Appl. Math. Lett. , 24(7):1265–1268, 2011

    2011

Show all 26 references
  1. [9]

    Cheng and B

    B. Cheng and B. Liu. Lexicographical ordering by spectral moments of trees with k pendant vertices and integer partitions. Appl. Math. Lett. , 25(5):858– 861, 2012

    2012

  2. [10]

    Cheng, B

    B. Cheng, B. Liu, and J. Liu. On the spectral moments of unicyclic graphs with fixed diameter. Linear Algebra Appl., 437(4):1123–1131, 2012

    2012

  3. [11]

    S. Li, H. Zhang, and M. Zhang. On the spectral moment of graphs with k cut edges. Electron. J. Linear Algebra, 26:718–731, 2013

    2013

  4. [12]

    Li and S

    S. Li and S. Hu. On the spectral moment of graphs with given clique number. Rocky Mountain J. Math. , 46(1):261–282, 2016

    2016

  5. [13]

    Clark and J

    G. Clark and J. Cooper. A Harary-Sachs theorem for hypergraphs. J. Combin. Theory Ser. B , 149:1–15, 2021

    2021

  6. [14]

    Y. Fan, T. Huang, Y. Bao, C. Zhuan-Sun, and Y. Li. The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs. Trans. Amer. Math. Soc. , 372(3):2213–2233, 2019

    2019

  7. [15]

    G. Gao, A. Chang, and Y. Hou. Spectral radius on linear r-graphs without expanded Kr+1. SIAM J. Discrete Math. , 36(2):1000–1011, 2022

    2022

  8. [16]

    Y. Fan, M. Tian, and M. Li. The stabilizing index and cyclic index of the coalescence and cartesian product of uniform hypergraphs. J. Combin. Theory Ser. A , 185:105537, 2022

    2022

  9. [17]

    Chen, E.R

    L. Chen, E.R. van Dam, and C. Bu. Spectra of power hypergraphs and signed graphs via parity-closed walks. J. Combin. Theory Ser. A , 207:105909, 2024. 23

    2024

  10. [18]

    J. Shao, L. Qi, and S. Hu. Some new trace formulas of tensors with applications in spectral hypergraph theory. Linear Multilinear Algebra, 63(5):971–992, 2015

    2015

  11. [19]

    Y. Fan, Y. Yang, C. She, J. Zheng, Y. Song, and H. Yang. The trace and Estrada index of uniform hypergraphs with cut vertices. Linear Algebra Appl., 660:89–117, 2023

    2023

  12. [20]

    L. Chen, C. Bu, and J. Zhou. Spectral moments of hypertrees and their appli- cations. Linear Multilinear Algebra, 70(21):6297–6311, 2022

    2022

  13. [21]

    Hu and L

    S. Hu and L. Qi. The eigenvectors associated with the zero eigenvalues of the laplacian and signless laplacian tensors of a uniform hypergraph. Discrete Appl. Math., 169:140–151, 2014

    2014

  14. [22]

    S. Hu, L. Qi, and J. Shao. Cored hypergraphs, power hypergraphs and their laplacian h-eigenvalues. Linear Algebra Appl., 439(10):2980–2998, 2013

    2013

  15. [23]

    L. Lim. Singular values and eigenvalues of tensors: a variational approach. In Proceedings 1st IEEE International Workshop on Computational Advances of Multitensor Adaptive Processing, pages 129–132. IEEE, 2005

    2005

  16. [24]

    Cardoso and V

    K. Cardoso and V. Trevisan. Energies of hypergraphs. Electron. J. Linear Algebra, 36:293–308, 2020

    2020

  17. [25]

    Zhou and C

    H. Zhou and C. Bu. Extremal Zagreb indices of bicyclic hypergraphs. Available at arXiv: 2506.08875

    arXiv

  18. [26]

    H. Lin, G. Yu, and B. Zhou. On the irregularity of uniform hypergraphs. Linear Algebra Appl., 678:107–124, 2023. 24

    2023

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.