Search arXivSearch

arXiv · 2404.08550

Differentiation of resultants and common roots of pairs of polynomials

Abstract

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of their coefficients. Zeros of resultant $R(f,g)$ correspond to the families of coefficients of $f$ and $g$ such that $f$ and $g$ have a common root. Herewith the calculation of this common root is a separate problem. The principal results on calculation of a unique common root of two polynomials and also about calculating a unique root of multiplicity 2 of a polynomial in terms of the first order partial derivatives of resultants and discriminants are given in the monograph by I.M. Gelfand, M.M. Kapranov, A.V. Zelevinsky [1, Ch. 3, Ch. 12]. A significant development of the ideas of this book in the direction of searching for formulas for multiple roots of polynomials is presented in the paper by I.A. Antipova, E.N. Mikhalkin, A.K. Tsikh [2]. The key result of this article is [2, Theorem 1] where the expression for a unique root of multiplicity $s \geq 3$ in terms of the first order partial derivatives of resultant of the polynomial and it's derivative of order $s-1$. In the present article the explicit formulas for higher derivatives of resultants of pairs of polynomials possessing common roots are obtained. On this basis a series of results that differ in ideas from [2, Theorem 1] linking higher derivatives of resultants and common multiple roots are proven. In addition the results obtained are applied for a new transparent proof of a refinement of [2, Theorem 1].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mikhail Chernyavsky, Andrei Lebedev, Yurii Trubnikov. 2024-04-12. Differentiation of resultants and common roots of pairs of polynomials. https://arxiv.org/abs/2404.08550

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the prime field spherical restriction conjecture in four dimensions: breaking the Stein-Tomas exponent and applications

Let $p$ be an odd prime. We prove the extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every nonzero-radius sphere $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq \, 34/11$, uniformly in $p$ and $j$. This improves the Stein--Tomas exponent $10/3$ established by Iosevich and Koh (2008). We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence of the restriction norm on the size of the physical support. This conjecture implies the spherical extension estimates $R_{S_j}^*(2\to r)\lesssim_r 1$ for every $r>3$, and yields almost-every-pin distance estimates at the conjectured Erdős--Falconer exponent in four dimensions, up to an arbitrarily small power loss in the set-size hypothesis. Using the same method, we improve the bounds supplied by Fourier decay and Plancherel at intermediate support scales and derive new almost-every-pin distance estimates in $\mathbb{F}_p^4$.

math.CA

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA

Establishing the Polynomial Wolff Axioms for $δ$-Separated $δ$-Tubes With #o-minimality

We establish the full version of a conjecture of Guth and Zahl, giving a lower bound for the volume of a semialgebraic set that has a large intersection with a collection of $δ$-separated $δ$-tubes. Our proof uses o-minimal methods to simplify the proof of Katz and Rogers, who proved the conjecture up to a small factor. We also establish that the constants depend polynomially on the complexity of the semialgebraic set, and more generally in the #o-minimal setting.

math.CA