Regularity of Roots of Polynomials

نویسندگان

  • ADAM PARUSIŃSKI
  • ARMIN RAINER
چکیده

Let Pa(Z) = Z n + ∑n j=1 ajZ n−j be a C curve of monic polynomials, ai ∈ C(I,C) where I ⊂ R is an interval. We show that if k = k(n) is sufficiently large then any choice of continuous roots of Pa is locally absolutely continuous, in a uniform way with respect to maxj ‖aj‖Ck on compact subintervals. This solves a problem that was open for more then a decade and shows that some systems of pseudodifferential equations are locally solvable. Our main tool is the resolution of singularities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Roots of Random Polynomials

We study the distribution of the complex roots of random polynomials of degree n with i.i.d. coefficients. Using techniques related to Rice’s treatment of the real roots question, we derive, under appropriate moment and regularity conditions, an exact formula for the average density of this distribution, which yields appropriate limit average densities. Further, using a different technique, we ...

متن کامل

Asymptotic Results for Random Polynomials on the Unit Circle

In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let {nk}k=1 be an infinite sequence of positive integers and let {zk}k=1 be a sequence of i.i.d. uniform distributed random variables on the unit circle. The above pair of sequences determine a sequence of ra...

متن کامل

Quasianalytic Multiparameter Perturbation of Polynomials and Normal Matrices

We study the regularity of the roots of multiparameter families of complex univariate monic polynomials P (x)(z) = z + Pn j=1(−1) aj(x)z n−j with fixed degree n whose coefficients belong to a certain subring C of Cfunctions. We require that C includes polynomial but excludes flat functions (quasianalyticity) and is closed under composition, derivation, division by a coordinate, and taking the i...

متن کامل

On Classifications of Random Polynomials

 Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...

متن کامل

On the Roots of Hosoya Polynomial of a Graph

Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013