Pith. sign in

REVIEW 2 major objections 5 minor 11 references

Chebyshev polynomials and Gram determinants from the M\"obius band

T0 review · 2 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash

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

Pith's one-line read The paper argues that Mersenne-number Chebyshev polynomials factor as $S_{2^k-1}(d)=\prod_{i=0}^{k-1} T_{2^i}(d)$ and that the Möbius-band Gram determinant $\det(\tilde G_n^{\mathrm{Mb},1})$ is divisible by $d^{2\binom{2n}{n-2}}$.

desk verdict Nice Chebyshev identity and a useful restatement, but the main determinant divisibility proof overcounts independent factors; the claim is not established. read the letter →

arxiv 2504.16439 v1 pith:DU3NY7UU submitted 2025-04-23 math.GT

Anthony Christiana , Dionne Ibarra , Gabriel Montoya-Vega This is my paper · ORCID
classification math.GT MSC 57K1057K31
keywords ChebyshevpolynomialsGramdeterminantsMöbiusbandMersennenumberscrossinglessconnectionsknottheorybilinearformskeinmodules
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

The paper aims to establish two linked results. First, for every Mersenne number $M_k=2^k-1$ with $k\ge 2$, the Chebyshev polynomial of the second kind $S_{M_k}(d)$ factors completely as a product of Chebyshev polynomials of the first kind, $S_{2^k-1}(d)=\prod_{i=0}^{k-1} T_{2^i}(d)$. Second, in the setting of crossingless connections on a Möbius band, it restates the conjectured closed formula for the Gram determinant $\det(\tilde G_n^{\mathrm{Mb},1})$ in terms of these polynomials and proves one factor of that formula: the determinant is divisible by $d^{2\binom{2n}{n-2}}$. A reader should care because this determinant is expected to be governed by Chebyshev polynomials, and confirming the predicted $d$-factor is evidence for the full closed formula.

What carries the argument

The load-bearing object is the Gram matrix $\tilde G_n^{\mathrm{Mb},1}$, whose rows and columns are crossingless connections on a Möbius band with exactly one arc through the crosscap, evaluated in the bilinear form after setting $y=0$ and $w=1$. The proof of Theorem 3.6 organizes the $\binom{2n}{n-2}$ four-element classes $\mathcal M$ of connections that differ only between two arcs; after column operations $c_1-c_2$ and $c_3-c_4$, the first and third columns of each $4\times 4$ block become divisible by $d$, so each block contributes $d^2$ to the determinant. The Chebyshev identity $S_{2^k-1}(d)=\prod_{i=0}^{k-1} T_{2^i}(d)$ is what rewrites all conjectured factors as products of second-kind Chebyshev polynomials.

What would settle it

Compute $\det(\tilde G_n^{\mathrm{Mb},1})$ for $n=5$ with the paper's algorithm and record the exact power of $d$ dividing it; if that power is smaller than $2\binom{10}{3}=240$, Theorem 3.6 is false, while a matching valuation would support the conjectured closed formula.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that two structures line up: elementary Chebyshev product-to-sum relations produce the Mersenne factorization, and the conjectured formula for $\det(\tilde G_n^{\mathrm{Mb},1})$ can be rewritten as $\prod_{k=2}^n (d^2-4)^{\binom{2n}{n-k}} (S_{k-1}(d))^{2\binom{2n}{n-k}}$. The paper's main theorem supplies the strongest low-degree factor of this conjecture: for $n\ge 2$, $\det(\tilde G_n^{\mathrm{Mb},1})$ is divisible by $(S_1(d))^{2\binom{2n}{n-2}}$, which equals $d^{2\binom{2n}{n-2}}$. The argument works by a column reduction on $4\times 4$ blocks of connections that differ only in two arcs, with $\binom{2n}{n-2}$ such blocks, each contributing a factor of $d^2$.

Load-bearing premise

The column-reduction argument assumes that the $\binom{2n}{n-2}$ four-element classes are independent blocks, each contributing a distinct $d^2$ factor, even though the blocks can overlap and can outnumber the rows of the matrix.

Editorial extensions

If this is right

  • The $k=2$ Chebyshev factor in Conjecture 3.5 is settled if Theorem 3.6 holds, reducing the open part of the formula to the factors $k=3,\dots,n$.
  • The restatement via Lemma 2.5 makes the type $(Mb)_1$ conjecture and the conjecture for type $Mb$ look structurally identical, both being products of second-kind Chebyshev polynomials.
  • The involutive notation and graph algorithm supply an explicit symbolic way to compute the Gram matrix, giving finite checks of the conjecture at any fixed $n$.
  • The Mersenne factorization $S_{2^k-1}(d)=\prod_{i=0}^{k-1} T_{2^i}(d)$ is a new closed-form relation that may transfer to other families of Gram determinants whose exponents are powers of two.

Reading between the lines

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

  • The Mersenne factorization suggests a skein-theoretic interpretation: the product $\prod_{i=0}^{k-1} T_{2^i}(d)$ may correspond to an evaluation of a skein idempotent, which would give a route to proving the restated Gram formulas.
  • Because the paper's algorithm computes the full Gram matrix symbolically, the conjecture can be checked at $n=5$ and $n=6$ without new theory, providing a computational target for any future proof.
  • If Theorem 3.6's factor is genuine, the conjecture for type $Mb$ would inherit a similar $d$-factor, suggesting the two determinants share a common Chebyshev skeleton.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 5 minor

Summary. The paper has two main strands. In Section 2 it proves identities relating Chebyshev polynomials of the first and second kind, culminating in Corollary 2.6: for the Mersenne number M_k = 2^k - 1, the polynomial S_{M_k}(d) factors as a product of T_{2^i}(d). In Sections 3 and 5 it restates, using these identities, the authors' earlier conjectured closed formulae for the Gram determinant of type (Mb)_1 and for Qi Chen's type-Mb determinant. The new mathematical claim is Theorem 3.6, which asserts that det(\tilde{G}_n^{Mb,1}) is divisible by S_1(d)^{2*C(2n,n-2)} = d^{2*C(2n,n-2)}. Section 4 describes a Mathematica program for computing the relevant bilinear form in involutive notation.

Significance. If Theorem 3.6 were correctly proved, it would provide a genuinely new, nontrivial factor of the conjectured Gram determinant of type (Mb)_1 and would lend support to Conjecture 3.5. The Chebyshev identities in Section 2 are elegant and correctly derived from standard product-to-sum formulas, and the algorithmic material in Section 4 could be useful. However, the proof of Theorem 3.6 has a load-bearing gap: the global divisibility conclusion is obtained by counting four-element classes without proving that the associated column reductions are independent. Because this theorem is the paper's main new result, the paper's central claim is not currently established.

major comments (2)
  1. [Section 3, proof of Theorem 3.6 (after Eq. (7))] The proof shows that for each class M of four elements, after the local column operations c1 -> c1 - c2 and c3 -> c3 - c4, two columns become divisible by d. It then states: "Since there are C(2n,n-2) classes then det(\tilde{G}_n^{Mb,1}) is divisible by d^{2*C(2n,n-2)}." This global conclusion requires that the 2*C(2n,n-2) column factors be independent contributions to the determinant. No such independence or rank argument is supplied. The classes are not disjoint, and the issue is quantitative already for small n: for n=3, 4*C(6,1)=24 exceeds |Mb_{3,1}|=C(6,2)=15, so the four-element classes overlap; for n=5, 2*C(10,3)=240 exceeds the number of columns C(10,4)=210, so the claimed exponent cannot arise from simply choosing two distinct d-divisible columns per class. The local calculations in Equations (4)-(7) may be correct, but determinant divisibility requires a bound on the rank of the span of the reduced columns modulo d, and no such bound appears. Theorem 3.6 is therefore not proved.
  2. [Section 3, proof of Theorem 3.6] Related to the previous comment, the proof treats the N classes as if they were independent blocks. The full Gram matrix is not block diagonal over these classes, and the column operation applied for one class can involve a column that has already been modified by an operation from another overlapping class. The paper does not justify that the divisibility property of a column survives all subsequent operations, nor that the operations commute in the required way. Thus the conclusion does not follow from the stated local column reduction.
minor comments (5)
  1. [Section 2, Lemma 2.3] The second displayed identity contains an unnecessary pair of parentheses and could be simplified to "T_{2n}(d) - 2 = (T_n(d))^2 - 4." The proof is clear, but the statement as printed is slightly awkward.
  2. [Section 3, Definition 3.1] The notation S_{2,\infty}(Mb \times I, {x_i}) is used without definition. A brief explanation or a precise pointer to [PBIMW] would improve readability for readers not familiar with that source.
  3. [Section 4] The Mathematica program is advertised but only referenced as [C] with no code listing or link. Since one of the paper's contributions is the algorithm, including the code or a more detailed description would be helpful.
  4. [Section 5, Conjecture 5.1] The formula for D_{n,i} appears to have a corrupted product symbol (rendered as "n˛") and should be typeset as a standard product. The authors should also verify the index range in that product.
  5. [Throughout] There are several formatting and typographical issues, including inconsistent spacing around "Möbius" and some garbled parentheticals. These should be corrected before any resubmission.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the paper's new results are derived from standard Chebyshev identities and a direct block argument; the restated conjectures are not used as inputs.

full rationale

The paper's derivation chain is self-contained. Corollary 2.6 follows from Lemma 2.5 and Lemma 2.3, which are proved using the standard product-to-sum formulas for Chebyshev polynomials; the only external input is a classical identity from [PBIMW] relating T_n and S_n, which is not the result being proven. Theorem 3.6 does not assume Conjecture 3.5 or Conjecture 3.3; it proceeds by a direct 4-element block argument and column operations, claiming a divisibility factor of the Gram determinant. The earlier conjectures from [IM1, IM2] are restated via Lemma 2.5, but they are not load-bearing for the proof. The self-citations present are contextual (definitions, prior conjectures, a computational script) and none supplies the central derivation. The potential issue raised by the reviewer is a possible logical gap in Theorem 3.6's proof—namely, that overlapping four-element classes may not yield independent d-factors—but that is a correctness concern, not a circularity concern. Since no claim reduces by construction to its own input and no fitted parameter is renamed as a prediction, the appropriate circularity score is 0.

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

No free parameters or invented entities. The paper uses standard Chebyshev polynomials and a prior Gram determinant framework. The main unproved input is the disjointness or independence of the classes in Theorem 3.6.

assumptions (4)
  • standard math Chebyshev polynomials satisfy the product-to-sum identities T_m T_n = T_{m+n} + T_{|m-n|} and S_m S_n = sum of S terms (Section 2, Equations 1 and 2).
    Background identities used to prove Lemma 2.3, Lemma 2.5, and Corollary 2.6; cited to [PBIMW] and standard.
  • domain assumption The bilinear form on crossingless connections of the Möbius band is well defined and its value counts disjoint simple closed curves with weights d, x, y, z, w (Definition 3.1).
    Framework imported from [IM1, IM2, BIMP]; the paper does not reprove the skein-theoretic setup.
  • domain assumption The graph G_{m1,m2} in Section 4 faithfully encodes the pairing and the simple closed curves in the Möbius band.
    Used for the algorithm; relies on topological facts about arcs through the crosscap.
  • ad hoc to paper The binom(2n,n-2) classes M are disjoint or otherwise yield independent d^2 factors in the proof of Theorem 3.6.
    This is the load-bearing premise of the final counting step; it is asserted but not proved, and the class counts suggest overlap (4*binom(6,1) > binom(6,2) for n=3).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Chebyshev polynomials and Gram determinants from the M\"obius band." pith.science (2026). https://pith.science/paper/DU3NY7UU

@misc{pith2026250416439,
  author       = {Pith},
  title        = {Pith review of: Chebyshev polynomials and Gram determinants from the M\"obius band},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DU3NY7UU}},
  note         = {Machine review of arXiv:2504.16439}
}
abstract

This article explores the connection between Chebyshev polynomials and knot theory, specifically in relation to Gram determinants. We reveal intriguing formulae involving the Chebyshev polynomial of the first and second kind. In particular we show that for Mersenne numbers, $M_k=2^k-1$ where $k\geq 2$, the $M_k$-th Chebyshev polynomial of the second kind is the product of Chebyshev polynomials of the first kind. We then discuss the Gram determinant of type $(Mb)_1$, restate the conjecture of its closed formula in terms of mostly products of Chebyshev polynomials of the second kind, and prove a factor of the determinant that supports the conjecture. We also showcase an algorithm for calculating the Gram determinant's corresponding matrix. Furthermore, we restate Qi Chen's conjectured closed formula for the Gram determinant of type Mb and discuss future directions.

Figures

Figures reproduced from arXiv: 2504.16439 by the authors.

Figure 3.1
Figure 3.1. The class of elements M that differ by two curves. connections made between the points 𝑋𝑛\𝑋 must all form homotopically trivial curves. So for 𝑛 ≥ 3, the entries of this matrix will have a multiple of a monomial 𝑢 = 𝑑 𝑝 for some 𝑝 ≥ 0. For 𝑛 = 2, 𝑢 = 1. (4) 𝐺 = (⟨𝑚𝑖 ,𝑚𝑗⟩)1≤𝑖,𝑗≤4 = © ­ ­ ­ « 𝑑𝑢 0 𝑢 𝑢 0 𝑑𝑢 𝑢 𝑢 𝑢 𝑢 𝑑𝑢 0 𝑢 𝑢 0 𝑑𝑢 ª ® ® ® ¬ . 𝐺 ∗ is constructed from 𝐺 by replacing 𝑐1 with 𝑐1 −𝑐2 as well as𝑐3 with 𝑐3 −𝑐4.… view at source ↗
Figure 3.2
Figure 3.2. Example of Case 1(a). (ii) Suppose 𝛾𝑘,𝑠 intersects the crosscap in 𝑚. Then 𝛾𝑘,𝑠 will intersect the crosscap in 𝑚3 and 𝛾𝑘,𝑠 will be a homotopically trivial curve. Therefore, ⟨𝑚,𝑚3⟩ = 𝑑𝑢𝑚. Furthermore, 𝛾𝑖,𝑗 will intersect the crosscap in 𝑚4 which implies that ⟨𝑚,𝑚4⟩ = 0. (a) ⟨𝑚,𝑚1⟩ = 𝑤𝑢𝑚 = 𝑢𝑚. (b) ⟨𝑚,𝑚2⟩ = 𝑤𝑢𝑚 = 𝑢𝑚. (c) ⟨𝑚,𝑚3⟩ = 𝑥𝑦𝑢𝑚 = 0. (d) ⟨𝑚,𝑚4⟩ = 𝑤𝑑𝑢𝑚 = 𝑑𝑢𝑚 [PITH_FULL_IMAGE:figures/full_fig_p007_3_2.png] view at source ↗
Figure 3.3
Figure 3.3. Example of Case 1(b)(i). Case 2 Suppose two simple closed curves 𝛼 and 𝛽 are formed from the points in 𝑋. Then one simple closed curve, say 𝛼 is formed from arcs in 𝑚 attached to {𝑥𝑖 , 𝑥𝑠 } and 𝛽 is formed from arcs in 𝑚 attached to {𝑥𝑗 , 𝑥𝑘 }. (a) Suppose 𝛼 intersects the crosscap in 𝑚, then 𝛽 intersects the crosscap in 𝑚1. Therefore, ⟨𝑚,𝑚1⟩ = 0. The skein move from 𝑚1 to 𝑚2 changes the 𝑦-curve to a homotopically t… view at source ↗
Figures from the paper (3 more)
Figure 3.4
Figure 3.4. Figure 3.4: Example of Case 2(a). (b) Suppose 𝛽 intersects the crosscap in 𝑚, then it intersects the crosscap twice. This implies that the second simple closed curve is homotopically trivial. Therefore, ⟨𝑚,𝑚1⟩ = 𝑑𝑢′′ 𝑚, where 𝑢 ′′ 𝑚 is a monomial. The skein move from 𝑚1 to 𝑚2 ch…
Figure 3.5
Figure 3.5. Figure 3.5: Example of Case 2(b). Therefore, for any element 𝑚 ∈ 𝑀𝑏0,1 there exists monomials 𝑢𝑚, 𝑢′ 𝑚, 𝑢′′ 𝑚 such that the block ⟨𝑚,𝑚1⟩, ⟨𝑚,𝑚2⟩, ⟨𝑚,𝑚3⟩, ⟨𝑚,𝑚4⟩ is equal to one of the rows of the matrix in Equation 6. (6)           0 0 0 0 𝑢𝑚 𝑢𝑚 𝑑𝑢𝑚 0 𝑢𝑚 𝑢𝑚 0 𝑑𝑢𝑚 0 𝑑𝑢′…
Figure 4.1
Figure 4.1. Figure 4.1: Example of graph 𝐺⟨𝑚1,𝑚2 ⟩ . Definition 4.4. Define𝐶𝑚1,𝑚2 = {𝐶1,𝐶2, . . . 𝐶𝑘 } such that Ã𝑘 𝑖=1𝐶𝑖 = 𝐺; it should be clear that deg(⟨𝑚1,𝑚2⟩) = 𝑘. We denote by ⟨𝐶𝑖⟩ the homotopy type of the closed curve in 𝑀𝑏 corresponding to the component 𝐶𝑖 . 2A word on cyclic group …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

11 extracted references · 10 canonical work pages

  1. [1]

    R. P. Bakshi, D. Ibarra, S. Mukherjee, J. H. Przytycki, A generalization of the Gram determinant of type A , Topology Appl. 295 (2021), Paper No. 107663, 15 pp. e-print: arXiv:1905.07834 https://arxiv.org/abs/1905.07834 [math.GT]

    work page Pith review arXiv 2021

  2. [2]

    Christiana, Gram Determinants of Type Mb, Version 1, 22 Apr

    A. Christiana, Gram Determinants of Type Mb, Version 1, 22 Apr. 2025, Mathematica script https://github.com/achristiana36/Gram-Determinants

    work page 2025

  3. [3]

    Skein Modules and the Noncommutative Torus

    C. Frohman, R. Gelca, Skein modules and the noncommutative torus. Trans. Amer. Math. Soc. 352 (2000), no. 10, 4877–4888. e-print: arXiv:9806107 https://arxiv.org/abs/math/9806107 [math.GT]

    work page Pith review arXiv 2000

  4. [4]

    On a new Gram determinant from the M\"obius band

    D. Ibarra, G. Montoya-Vega, A New Gram Determinant from the M\"obius Band, Journal of Knot Theory and Its Ramifications, 33 (12), 2450037 (2024), DOI 10.1142/S0218216524500378 https://www.worldscientific.com/doi/10.1142/S0218216524500378. e-print: arXiv:2304.05616 https://arxiv.org/abs/2304.05616 [math.GT]

    work page Pith review arXiv 2024

  5. [5]

    Ibarra, G

    D. Ibarra, G. Montoya-Vega, A Study of Gram Determinants in Knot Theory, To Appear in AMS Contemporary Mathematics Series. e-print: arXiv:2402.09704 https://arxiv.org/abs/2402.09704 [math.GT]

    work page arXiv

  6. [6]

    L. H. Kauffman, S. L. Lins, Temperley-Lieb recoupling theory and invariants of 3 -manifolds. Ann. of Math. Stud., 134 Princeton University Press, Princeton, NJ, 1994. x+296 pp

    work page 1994

  7. [7]

    W. B. R. Lickorish, An introduction to knot theory. (English summary) Graduate Texts in Mathematics , 175. Springer-Verlag, New York, 1997

    work page 1997

  8. [8]

    J. C. Mason, D. C. Handscomb, Chebyshev Polynomials , Chapman & Hall/CRC, 2003, doi.org/10.1201/9781420036114 https://www.taylorfrancis.com/books/mono/10.1201/9781420036114/chebyshev-polynomials-mason-david-handscomb

    doi:10.1201/9781420036114 2003

Show all 11 references
  1. [9]

    J. H. Przytycki, t_k -moves on links, In Braids , ed. J.S.Birman and A.Libgober, Contemporary Math. Vol. 78, 1988, 615-656; e-print: arXiv: 0606633 http://arxiv.org/abs/math.GT/0606633 [math.GT]

    1988

  2. [10]

    J. H. Przytycki, R. P. Bakshi, D. Ibarra, G. Montoya-Vega, D. E. Weeks, Lectures in Knot Theory: An Exploration of Contemporary Topics, Springer Universitext, Springer International Publishing. 2024 March. DOI 10.1007/978-3-031-40044-5 https://link.springer.com/book/10.1007/97...

    2024 doi

  3. [11]

    Reshetikhin, V.G

    N. Reshetikhin, V.G. Turaev, Invariants of 3 -manifolds via link polynomials and quantum groups. Invent. Math. 103 (1991), no. 3, 547–597

    1991

Pith tools

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