Related papers: Constraints on counterexamples to the Casas-Alvero…
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 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…
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 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.
In 2005 Wolfgang Willems put forward a conjecture proposing a lower bound for the sum of squares of the degrees of the irreducible $p$-Brauer characters of a finite group $G$. We prove this conjecture for the prime $p=2$. For this we rely…
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) =…
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…
We use state-of-art lattice algorithms to improve the upper bound on the lowest counterexample to the Mertens conjecture to $\approx \exp(1.96 \times 10^{19})$, which is significantly below the conjectured value of $\approx \exp(5.15 \times…
Since the transformative workshop by the American Institute of Mathematics on the minimum rank of a graph, two longstanding open problems have captivated the community interested in the minimum rank of graphs: the graph complement…
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,…
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 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 establish a lower bound for the size of possible counterexamples of the Dixmier Conjecture. We prove that $B>15$, where $B$ is the minimum of the greatest common divisor of the total degrees of $P$ and $Q$, where $(P,Q)$ runs over the…
We improve the algebraic methods of Abhyankar for the Jacobian Conjecture in dimension two and describe the shape of possible counterexamples. We give an elementary proof of the result of Heitmann, which states that gcd(deg(P),deg(Q)) is…
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.…
The article presents the proof of Casas-Alvero conjecture.
In this paper we present an explicit counterexample of degree $n=7$, which shows that the conjecture proposed by Li et al. \cite{Li2013} regarding the first derivative bounds for rational B\'ezier curves is generally false. We further…
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…
A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…
We study the integral Hodge conjecture in complex codimension $2$ and $3$ for approximations to the classifying space of groups of type A. In degree two, we prove a conjecture of Ben Antieau, extending his two counterexamples to a general…