Related papers: Polynomial problems of the Casas-Alvero type
We investigate necessary and sufficient conditions for an arbitrary polynomial of degree $n$ to be trivial, i.e. to have the form $a(z-b)^n$. These results are related to an open problem, conjectured in 2001 by E. Casas- Alvero. It says,…
We present a proof of the Casas-Alvero conjecture, stating that if a complex polynomial has a root in common with each of its derivatives it must be a multiple of the power of some monomial.
Over a field of characteristic zero, it is clear that a polynomial of the form (X-a)^d has a non-trivial common factor with each of its d-1 first derivatives. The converse has been conjectured by Casas-Alvero. Up to now there have only been…
The Casas-Alvero conjecture predicts that every univariate polynomial over an algebraically closed field of characteristic zero sharing a common factor with each of its Hasse-Schmidt derivatives is a power of a linear polynomial. The…
The Casas-Alvero conjecture states: if a complex univariate polynomial has a common root with each of its derivatives, then it has a unique root. We show that hypothetical counterexamples must have at least 5 different roots. The first case…
The Casas-Alvero conjecture predicts that every univariate polynomial over a field of characteristic zero having a common factor with each of its derivatives $H_i(f)$ is a power of a linear polynomial. One approach to proving the conjecture…
The Casas-Alvero conjecture says that a degree $n$ complex univariate polynomial sharing a root with each of its derivative must have only one root. In this article we give three results. The first one, is that the number of possible…
Based on Casas-Alvero conjecture \textit{[J. Algebra, 2001]} we formulate the following conjecture.\\ \textbf{C*-algebraic Casas-Alvero Conjecture : Let $\mathcal{A}$ be a commutative C*-algebra, $n\in \mathbb{N}$ and let $P(z) =…
The Casas--Alvero conjecture predicts that every univariate polynomial over a field of characteristic zero having a common factor with each of its derivatives $H_i(f)$ is a power of a linear polynomial. One approach to proving the…
We study varieties defined by parameterizing polynomials of derivatives through a computational algebro-geometric approach, especially relying on Combinatorial Nullstellensatz and Noether normalization. We establish that these polynomials…
The Casas--Alvero conjecture predicts that every univariate polynomial $f$ over a field $K$ of characteristic zero having a common factor with each of its derivatives $H\_i(f)$ is a power of a linear polynomial. Let…
The Casas-Alvero conjecture states that if $f(X)$ is a monic univariate polynomial of degree $d$ over a characteristic $0$ field $\mathbb{K}$ such that $\gcd(f, f_{i})$ is non-trivial for each $i=1, \dots, d-1$, then $f(X)=(X-\alpha)^d$ for…
The Casas-Alvero conjecture is about interpolation polynomials. There are some partial proofs of it, but there is not any proof in the general case.In this paper we propose three.
According to Casas Alvero conjecture, if a one variable polynomial of degree $n$ over a field of characteristic 0 is not prime with each of the $n-1$ first derivees, then it is of the form $c (X-r)^{n}$. Let $p$ be a prime number and an…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.
In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We classify all two-dimensional simple algebras (which may be non-associative) over an algebraically closed field. For each two-dimensional algebra $\mathcal{A}$, we describe a minimal (with respect to inclusion) generating set for the…