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

preprint2015arXivOpen access

Abstract

Given a polynomial f(x)=a0xn+a1xn−1+⋯+an f(x)=a_0x^n+a_1x^{n-1}+\cdots +a_n with positive coefficients aka_k, and a positive integer M≤nM\leq n, we define a(n infinite) generalized Hurwitz matrix HM(f):=(aMj−i)i,jH_M(f):=(a_{Mj-i})_{i,j}. We prove that the polynomial f(z)f(z) does not vanish in the sector {z∈C:∣arg⁡(z)∣<πM} \left\{z\in\mathbb{C}: |\arg (z)| < \fracπ{M}\right\} whenever the matrix HMH_M is totally nonnegative. This result generalizes the classical Hurwitz' Theorem on stable polynomials (M=2M=2), the Aissen-Edrei-Schoenberg-Whitney theorem on polynomials with negative real roots (M=1M=1), and the Cowling-Thron theorem (M=nM=n). In this connection, we also develop a generalization of the classical Euclidean algorithm, of independent interest per se.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.