Related papers: How Fermat found extrema
This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is…
This paper presents a modification of Secant method for finding roots of equations that uses three points for iteration instead of just two. The development of the mathematical formula to be used in the iteration process is provided…
This article presents a new method for calculating square roots in GF(p) by exponentiating in GF(p^3) or equivalently modulo irreducible cubic polynomials. This algorithm is in some ways similar to the Cipolla-Lehmer algorithm which is…
Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…
Let $p(z)$ be a monic cubic complex polynomial with distinct roots and distinct critical points. We say a critical point has the {\it Voronoi property} if it lies in the Voronoi cell of a root $\theta$, $V(\theta)$, i.e. the set of points…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…
We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…
In the paper we partially solved the problem of the distribution of the discriminants of integral polynomials in the cubic case. We proved the asymptotic formula for the number of integral cubic polynomials having bounded height and bounded…
What can we deduce about the roots of a real polynomial in one variable by simply considering the signs of its coefficients? On one hand, we give a complete answer concerning the positive roots, by proposing a statement of Descartes' rule…
Consider polynomials over ${\rm GF}(2)$. We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree $r$ for all…
Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let $q$ be a prime power, $n$ be a positive integer and $\sigma$ be a generator of…
We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…
We show the existence of ``good'' approximations to a real number $\gamma$ using rationals with denominators formed by digits $0$ and $1$ in base $b$. We derive an elementary estimate and enhance this result by managing exponential sums.
An arithmetic method of proving the irrationality of smooth projective 3-folds is described, using reduction modulo $p$. It is illustrated by an application to a cubic threefold, for which the hypothesis that its intermediate Jacobian is…
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…
A multiset $\Lambda=\{\lambda_1,\ldots,\lambda_n\}$ of complex numbers is said to be realizable whenever there exists a nonnegative matrix of order $n$ with spectrum $\Lambda$. One of the broadest criterion that guarantees realizability is…
We show that, apart from some obvious exceptions, the number of trinomials vanishing at given complex numbers is bounded by an absolute constant. When the numbers are algebraic, we also bound effectively the degrees and the heights of these…
We present short elementary proofs of the well-known Ruffini-Abel-Galois theorems on insolvability of algebraic equations in radicals. These proofs are obtained from existing expositions by stripping away material not required for the…