Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Root structures of polynomials with sparse exponents (2204.05046v1)

Published 11 Apr 2022 in math.CA, cs.NA, and math.NA

Abstract: For real polynomials with (sparse) exponents in some fixed set, [ \Psi(t)=x+y_1t{k_1}+\ldots +y_L t{k_L}, ] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots into tiers, each containing roots of comparable sizes. We then show that there exists a suitable small parameter $\epsilon>0$ such that, for any root $w\in \mathbb{C}$, $B(w,\epsilon|w|)$ contains at most $L$ roots, counted with multiplicity. Our analysis suggests the consideration of a rough factorisation of the original polynomial and we establish the closeness of the corresponding root structures: there exists a covering of the roots by balls wherein a) each ball contains the same number of roots of the original polynomial and of its rough factorisation and b) the balls are strongly separated.

Summary

We haven't generated a summary for this paper yet.