Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Polynomial problems of the Casas-Alvero type (1308.5320v5)

Published 24 Aug 2013 in math.CA

Abstract: We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)n. To do this, we derive new properties of polynomials and their roots. In particular, it concerns new bounds and genetic sum's representations of the Abel -Goncharov interpolation polynomials. Moreover, we prove the Sz.-Nagy type identities, the Laguerre and Obreshkov-Chebotarev type inequalities for roots of polynomials and their derivatives. As applications these results are associated with the known problem, conjectured by Casas- Alvero in 2001, which says, that any complex univariate polynomial, having a common root with each of its non-constant derivative must be a power of a linear polynomial. We investigate particular cases of the problem, when the conjecture holds true or, possibly, is false.

Summary

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