Generalized Hurwitz matrices, generalized Euclidean algorithm, and forbidden sectors of the complex plane

Abstract

Given a polynomial \[ f(x)=a0xn+a1xn-1+·s +an \] with positive coefficients ak, and a positive integer M≤ n, we define a(n infinite) generalized Hurwitz matrix HM(f):=(aMj-i)i,j. We prove that the polynomial f(z) does not vanish in the sector \z∈C: | (z)| < πM\ whenever the matrix HM is totally nonnegative. This result generalizes the classical Hurwitz' Theorem on stable polynomials (M=2), the Aissen-Edrei-Schoenberg-Whitney theorem on polynomials with negative real roots (M=1), and the Cowling-Thron theorem (M=n). In this connection, we also develop a generalization of the classical Euclidean algorithm, of independent interest per se.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…