Pith. sign in

REVIEW 4 minor 29 references

Bounds for the Zeros of Quaternionic Polynomials via Matrix Methods

T0 review · 0 major / 4 minor · reviewed 2026-05-10 · grok-4.3

Challenge this review Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read New bounds derived from Gershgorin theorems and spectral norms on companion matrices improve estimates for the zeros of quaternionic polynomials.

desk verdict The paper adapts Gershgorin disks and spectral-norm bounds to left eigenvalues of companion matrices for quaternionic polynomials, adds an auxiliary polynomial construction, and supplies code plus examples that show modest improvements over Cauchy/Fujiwara/Opfer. read the letter →

arxiv 2604.11222 v1 submitted 2026-04-13 math.CV

Ovaisa Jan , Idrees Qasim , Nusrat Ahmed Dar This is my paper · ORCID
classification math.CV
keywords quaternionicpolynomialszeroboundscompanionmatricesGershgorintheoremspectralradiuslefteigenvaluesmatrixnorms
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 tighter upper bounds on the moduli of zeros for polynomials with quaternion coefficients. It does so by linking the zeros to the eigenvalues of specially built companion matrices and then applying circle theorems and norm estimates to those matrices. A sympathetic reader would care because better zero localization aids analysis in areas where quaternionic polynomials model physical or engineering systems. The authors also supply a practical algorithm and code to select the tightest bound for a given polynomial.

What carries the argument

The companion matrix associated to the quaternionic polynomial, whose left eigenvalues are localized by Gershgorin disks and whose spectral radius supplies additional bounds.

What would settle it

A concrete quaternionic polynomial whose largest zero modulus exceeds the upper bound computed by one of the new theorems.

Watch

Extended reading notes

Core claim

By constructing left monic companion matrices for quaternionic polynomials and invoking Gershgorin-type localization for their left eigenvalues together with spectral-norm bounds on an auxiliary matrix, the paper obtains upper bounds on zero moduli that are strictly smaller than those of Cauchy, Fujiwara, and Opfer in many cases.

Load-bearing premise

The localization theorems for the left eigenvalues of the companion matrix translate directly into modulus bounds on the roots of the original polynomial.

Editorial extensions

If this is right

  • The new bounds are sharper than the classical Cauchy, Fujiwara, and Opfer bounds for many polynomials.
  • Block-matrix techniques yield further upper bounds via the spectral radius of a constructed auxiliary polynomial.
  • An algorithm together with Python code automatically selects the theorem that gives the smallest upper bound for any input polynomial.
  • These bounds apply without extra restrictions on the coefficients or the degree of the polynomial.

Reading between the lines

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

  • Such improved localization could reduce the search space in numerical root-finding routines for quaternionic equations.
  • The matrix approach may extend to other non-commutative division algebras beyond quaternions.
  • Applications in signal processing could benefit from faster verification that all roots lie inside a computed disk.
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, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper derives new upper bounds on the zeros of left-monic quaternionic polynomials by constructing companion matrices whose left eigenvalues coincide with the polynomial zeros, then applying Gershgorin-type localization theorems for left eigenvalues together with spectral-norm bounds on auxiliary block matrices. It claims these bounds improve upon the classical Cauchy, Fujiwara, and Opfer estimates, illustrates the improvements with numerical examples, and supplies an algorithm plus Python code that selects the sharpest bound for a given input polynomial.

Significance. If the matrix constructions and eigenvalue correspondences hold, the work supplies sharper, explicitly computable localization tools for quaternionic polynomials. The reproducible code and selection algorithm constitute a concrete strength, enabling direct verification and practical use in numerical analysis, signal processing, and quaternionic quantum mechanics.

minor comments (4)
  1. Abstract: the phrase 'auxiliary poly nomial' contains an extraneous space; correct to 'auxiliary polynomial'.
  2. §4 (Examples): the tables or figures comparing new bounds with Cauchy/Fujiwara/Opfer should list the explicit numerical values of each bound for every example polynomial, rather than only stating 'sharper'.
  3. §5 (Algorithm): the pseudocode or Python implementation should be placed in an appendix or supplementary file so that the selection procedure is fully reproducible without external links.
  4. Notation: consistently distinguish left eigenvalues from right eigenvalues throughout the companion-matrix constructions (e.g., in the statement of Theorem 3.2).

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful and positive assessment of our manuscript. The report recommends minor revision, yet no specific major comments are provided. We are pleased that the matrix-based approach, Gershgorin-type bounds, improvements over classical estimates, numerical examples, algorithm, and Python code are recognized as strengths. Since no concrete points for revision or rebuttal were raised, we have no changes to propose at this stage.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity detected

full rationale

The paper constructs companion matrices for left-monic quaternionic polynomials, proves that their left eigenvalues coincide with the polynomial zeros via direct linear algebra, and then applies standard Gershgorin disk theorems and spectral-norm bounds to these matrices. These steps rely on independently established matrix localization results rather than fitting parameters to the target bounds or redefining the zeros in terms of the bounds themselves. Comparisons to Cauchy, Fujiwara, and Opfer bounds are external benchmarks, and the provided Python code simply selects among the derived theorems on examples without circular fitting. No load-bearing self-citation chains or ansatz smuggling appear in the derivation.

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

The central claims rest on standard properties of quaternionic algebra and matrix localization theorems; no free parameters or new entities are introduced in the abstract.

assumptions (2)
  • domain assumption Gershgorin-type localization theorems extend to left eigenvalues of matrices associated with left-monic quaternionic polynomials
    Invoked as the basis for the first family of bounds.
  • standard math Spectral radius of the companion matrix bounds the moduli of the polynomial zeros
    Used in the matrix-norm approach.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Bounds for the Zeros of Quaternionic Polynomials via Matrix Methods." pith.science (2026). https://pith.science/paper/2604.11222

@misc{pith2026260411222,
  author       = {Pith},
  title        = {Pith review of: Bounds for the Zeros of Quaternionic Polynomials via Matrix Methods},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2604.11222}},
  note         = {Machine review of arXiv:2604.11222}
}
read the original abstract

In this paper, we derive new bounds for the zeros of quaternionic polynomials by applying localization theorems, which includes Gershgorin-type theorems for the left eigenvalues of matrices of left monic quaternionic polynomials. These results yield sharper estimates compared to existing bounds, including improvements upon Cauchy, Fujiwara and Opfer's classical bounds. Second, we develop a matrix norm approach utilizing block matrix techniques and spectral norm estimates for a specially constructed auxiliary poly nomial. This method provides additional upper bounds for polynomial zeros through careful analysis of the companion matrix's spectral radius. The comparison between the new bounds and some existing bounds have been illustrated with several examples. At the end of the paper we have given an algorithm. We have also given a Python code that predicts, for a given input which theorem will yield the sharpest upper bound. The combination of these approaches enhances the theoretical toolkit for analyzing quaternionic polynomials and offers potential applications in numerical methods, signal processing, and quaternionic quantum mechanics where zero location problems naturally arise.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    S. L. Adler,Quaternionic Quantum Mechanics and Quantum Fields Oxford Uni- versity Press, New York, (1995)

    work page 1995

  2. [2]

    S. S. Ahmad, I. Ali, Bounds for eigenvalues of matrix polynomials over quaternion division algebra,Adv. Appl. Clifford Algebras,26,(2016),1095-1125

    work page 2016

  3. [3]

    S. S. Ahmad, I. Ali, Localization theorems for matrices and bounds for the zeros of polynomials over quaternion division Algebra,Filomat,32, (2018), 553–573

    work page 2018

  4. [4]

    I. Ali, N. Truhar, Location of rigt eigenvalues of quaternionic matrix polynomials, Adv. Appl. Clifford Algebras,29:80, (2019)

    work page 2019

  5. [5]

    Baker, Right eigenvalues for quaternionic matrices: a topological approach,Lin- ear Algebra Appl.,286, (1999), 303–309

    A. Baker, Right eigenvalues for quaternionic matrices: a topological approach,Lin- ear Algebra Appl.,286, (1999), 303–309

    work page 1999

  6. [6]

    J. L. Brenner, Matrices of quaternions,Pacific J. Math,1, (1951), 329–335

    work page 1951

  7. [7]

    J. H. Conway, D.A. Smith,On Quaternions and Octonions: Their Geometry, Arith- metic, and Symmetry. A K Peters, Natick (2002)

    work page 2002

  8. [8]

    I. Dar, N. A. Rather, I. Faiq,Bounds on the zeros of quaternionic polynomials using matrix methods, Filomat,38(9), (2024)

    work page 2024

Show all 29 references
  1. [9]

    Gentili, D

    G. Gentili, D. C. Struppa,On the multiplicity of zeros of polynomials with quater- nionic coefficients,Milan Journal of Mathematics,76, (2008), 15-25

    2008

  2. [10]

    Gerstner, R

    A.B. Gerstner, R. Byers, V. Mehrmann,A quaternion QR algorithm, Numer. Math. 55, (1989), 83-95

    1989

  3. [11]

    Gordon, T

    B. Gordon, T. S. Motzkin,On the zeros of polynomials over division rings,Trans. Amer. Math. Soc.116, (1965), 218-226

    1965

  4. [12]

    Hankins,Sir William Rowan Hamilton

    T.L. Hankins,Sir William Rowan Hamilton. The Johns Hopkins University Press, Baltimore (1980)

    1980

  5. [13]

    Huang, W

    L. Huang, W. So,On the left eigenvalues of a quaternionic matrix, Linear Algebra Appl.,332, (2001), 105–116

    2001

  6. [14]

    Janovsk´ a, G

    D. Janovsk´ a, G. Opfer,The classification and the computation of the zeros of quater- nionic, two-sided polynomials,Numer. Math.,115, (2010), 81–100. 16

    2010

  7. [15]

    Janovsk´ a, G

    D. Janovsk´ a, G. Opfer,A note on the computation of all zeros of simple quaternionic polynomials,SIAM J. Numer. Anal.,48(1), (2010), 244–256

    2010

  8. [16]

    M. W. Khadim, I. Ali,Bounds for the zeros of Quaternionic polynomials, Gulf Journal of Mathematics,22, (2026), 1-16

    2026

  9. [17]

    S. D. Leo, G. Ducati, and V. Leonardi,Zeros of unilateral quaternionic polnomials, Electron. J. Linear Algebra.,15, (2006), 297–313

    2006

  10. [18]

    Niven,Equations in quaternions,Amer

    I. Niven,Equations in quaternions,Amer. Math. Monthly,48, (1941), 654–661

    1941

  11. [19]

    Opfer, Polynomials and Vandermonde matrices over the field of quaternions, Electron

    G. Opfer, Polynomials and Vandermonde matrices over the field of quaternions, Electron. Trans. Numer. Anal.,36, (2009), 9–16

    2009

  12. [20]

    Pereira,Quaternionic polynomials and behavioral systems

    R. Pereira,Quaternionic polynomials and behavioral systems. Ph.D. thesis, Univer- sity of Aveiro (2006)

    2006

  13. [21]

    Pogorui, M

    A. Pogorui, M. Shapiro,On the structure of the set of zeros of quaternionic polyno- mials,Complex Var. and Elliptic Funct.,49, (2004), 379–389

    2004

  14. [22]

    Rodman,Pairs of hermitian and skew hermitian quaternionic matrices canonical forms and their applications,Linear Algebra Appl.429, (2008), 981–1019

    L. Rodman,Pairs of hermitian and skew hermitian quaternionic matrices canonical forms and their applications,Linear Algebra Appl.429, (2008), 981–1019

    2008

  15. [23]

    Rodman, Stability of invariant subspaces of quaternion matrices.Complex Anal

    L. Rodman, Stability of invariant subspaces of quaternion matrices.Complex Anal. Oper. Theory,6, (2012), 1069–1119

    2012

  16. [24]

    Serodio, E

    R. Serodio, E. Pereira, and J. Vit´ oria,Computing the zeros of quaternion polyno- mials, Comput. Math. Appl.,42, (2001), 1229–1237

    2001

  17. [25]

    R. M. W. Wood,Quaternionic eigenvalues, Bull. Lond. Math. Soc.,17, (1985), 137-138

    1985

  18. [26]

    Wu. R. L, Distribution and estimation for eigenvalues of dual quaternion matrices, Comput. Math. Appl.,55, (2008), 1998–2004

    2008

  19. [27]

    Zhang, Gershgorin type theorems for quaternionic matrices,Linear Algebra Appl., 424, (2007), 139–153

    F. Zhang, Gershgorin type theorems for quaternionic matrices,Linear Algebra Appl., 424, (2007), 139–153

    2007

  20. [28]

    Zhang, Quaternions and matrices of quaternions,Linear Algebra Appl.,251, (1997), 21–57

    F. Zhang, Quaternions and matrices of quaternions,Linear Algebra Appl.,251, (1997), 21–57

    1997

  21. [29]

    " " Analyzes the c o e f f i c i e n t s to predict which theorem will yield the sharpest upper bound

    L. Zou, Y. Jiang, J. Wu, Location for the right eigenvalues of quaternion matrices, J. Appl. Math. Comput.,38, (2012), 71–83. 17 Appendix A. Python Implementation of the Heuristic Optimizer The following Python script provides a complete, executable implementation of the heuri...

    2012

Pith tools

Reviewed May 10, 2026 · model on record in the stance chip above.