相关论文: Local Descriptions of Roots of Cubic Equations ove…
We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…
We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…
The conditions for cubic equations, to have 3 real roots and 2 of the roots lie in the closed interval $[-1, 1]$ are given. These conditions are visualized. This question arises in physics in e.g. the theory of tops.
The real roots of the cubic and quartic polynomials are studied geometrically with the help of their respective Siebeck--Marden--Northshield equilateral triangle and regular tetrahedron. The Vi\`ete trigonometric formulae for the roots of…
Let $\mathbb{Z}_p[x]$ be the set of all functions whose coefficients are in the field of $p$-adic integers $\mathbb{Z}_p$. This work considers a problem of finding a root of a polynomial equation $P(x)=0$ where $P(x)\in\mathbb{Z}_p[x]$. The…
The field of $p$-adic numbers $\mathbb{Q}_p$ and the ring of $p$-adic integers $\mathbb{Z}_p$ are essential constructions of modern number theory. Hensel's lemma, described by Gouv\^ea as the "most important algebraic property of the…
We provide a solvability criteria for a depressed cubic equation in domains $\bz_p^{*},\bz_p,\bq_p$. We show that, in principal, the Cardano method is not always applicable for such equations. Moreover, the numbers of solutions of the…
An observation by J-P. Serre implies that cubic polynomials are unique among generic monic polynomials of degree 2 or higher in that they have a root that is a power series in the discriminant of the polynomial. We provide formulas for this…
Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…
In this brief note, we consider p-adic unit roots or poles of L-functions of exponential sums defined over finite fields. In particular, we look at the number of unit roots or poles, and a congruence relation on the units. This raises a…
Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…
We study the repartition of the roots of a random p-adic polynomial in an algebraic closure of Qp.We prove that the mean number of roots generating a fixed finite extension K of Qp depends mostly on the discriminant of K, an extension…
We show that smooth curves of monic complex polynomials $P_a (Z)=Z^n+\sum_{j=1}^n a_j Z^{n-j}$, $a_j : I \to \mathbb C$ with $I \subset \mathbb R$ a compact interval, have absolutely continuous roots in a uniform way. More precisely, there…
We study the regularity of the roots of multiparameter families of complex univariate monic polynomials $P(x)(z) = z^n + \sum_{j=1}^n (-1)^j a_j(x) z^{n-j}$ with fixed degree $n$ whose coefficients belong to a certain subring $\mathcal C$…
We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…
The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…
The isolation intervals of the real roots of the real symbolic monic cubic polynomial $p(x) = x^3 + a x^2 + b x + c\,\,$ are found in terms of simple functions of the coefficients of the polynomial (such as: $-a$, $-a/3$, $-c/b$, $\pm…
The solution of the cubic equation has a century-long history; however, the usual presentation is geared towards applications in algebra and is somewhat inconvenient to use in optimization where frequently the main interest lies in real…
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…