English
Related papers

Related papers: Extremal problems for polynomials with real roots

200 papers

This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…

General Mathematics · Mathematics 2022-11-16 Yassine Larbaoui

We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…

Complex Variables · Mathematics 2016-12-26 Catherine Bénéteau , Dmitry Khavinson , Constanze Liaw , Daniel Seco , Alan A. Sola

We consider the set of the power non-negative polynomials of several variables and its subset that consists of polynomials which can be represented as a sum of squares. It is shown in the classic work by D.Hilbert that it is a proper…

Classical Analysis and ODEs · Mathematics 2014-10-01 L. A. Sakhnovich

The famous T. Suffridge polynomials have many extremal properties: the maximality of coefficients when the leading coefficient is maximal; the zeros of the derivative are located on the unit circle; the maximum radius of stretching the unit…

Complex Variables · Mathematics 2022-06-06 Dmitriy Dmitrishin , Alex Stokolos , Daniel Gray

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

Algebraic Geometry · Mathematics 2013-09-03 Kaitlyn Phillipson , J. Maurice Rojas

The classical Descartes' rule of signs limits the number of positive roots of a real polynomial in one variable by the number of sign changes in the sequence of its coefficients. One can ask the question which pairs of nonnegative integers…

Classical Analysis and ODEs · Mathematics 2019-05-10 Vladimir Petrov Kostov

We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…

Functional Analysis · Mathematics 2016-06-07 Daniel Carando , Damian Pinasco , Jorge Tomás Rodríguez

We develop the tools to bound extreme roots of multivariate real zero polynomials globally. This is done through the use of a relaxation that approximates their rigidly convex sets. This relaxation can easily be constructed using the degree…

Combinatorics · Mathematics 2025-10-14 Alejandro González Nevado

Control theory has recently been involved in the field of nuclear magnetic resonance imagery. The goal is to control the magnetic field optimally in order to improve the contrast between two biological matters on the pictures. Geometric…

Symbolic Computation · Computer Science 2017-07-07 Bernard Bonnard , Jean-Charles Faugère , Alain Jacquemard , Mohab Safey El Din , Thibaut Verron

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

Differential Geometry · Mathematics 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

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…

Number Theory · Mathematics 2007-05-23 Jean-Claude Evard

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

Combinatorics · Mathematics 2012-04-24 Ebrahim Ghorbani

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

In this paper, we exhibit new monotonicity properties of roots of families of orthogonal polynomials $P_n^{(z)}(x)$ depending polynomially on a parameter (Laguerre and Gegenbauer). By establishing that $P_n^{(z)}(x)$ are realrooted in $z$…

Classical Analysis and ODEs · Mathematics 2024-12-10 Aurelien Xavier Gribinski

We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP…

Number Theory · Mathematics 2010-11-09 Martín Avendaño , Ashraf Ibrahim , J. Maurice Rojas , Korben Rusek

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

Number Theory · Mathematics 2022-03-16 Dragan Stankov

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon

In the present paper we consider $F_k(x)=x^{k}-\sum_{t=0}^{k-1}x^t,$ the characteristic polynomial of the $k$-th order Fibonacci sequence, the latter denoted $G(k,l).$ We determine the limits of the real roots of certain odd and even degree…

Classical Analysis and ODEs · Mathematics 2007-09-04 Xinyun Zhu , George Grossman

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…

Symbolic Computation · Computer Science 2007-05-23 Guillaume Moroz

In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…

Symbolic Computation · Computer Science 2023-06-08 George Labahn , Cordian Riener , Mohab Safey El Din , Éric Schost , Thi Xuan Vu