English
Related papers

Related papers: The Hermite-Sylvester criterion for real-rooted po…

200 papers

We first show the existence of an effective determinantal representation for any univariate polynomial with real coefficients. Then, we more precisely establish that any univariate polynomial with real coefficients has an effective…

Rings and Algebras · Mathematics 2008-09-05 Ronan Quarez

A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition…

Optimization and Control · Mathematics 2012-09-19 Amir Ali Ahmadi , Pablo A. Parrilo

Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and…

Optimization and Control · Mathematics 2023-08-28 Sarah Gift , Hugo J. Woerdeman

Let $R$ be a positively graded algebra over a field. We say that $R$ is Hilbert-cyclotomic if the numerator of its reduced Hilbert series has all of its roots on the unit circle. Such rings arise naturally in commutative algebra, numerical…

Commutative Algebra · Mathematics 2021-06-10 Alessio Borzì , Alessio D'Alì

In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.

General Mathematics · Mathematics 2019-04-02 Huan Xiao

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

In these notes, we consider the problem of finding the logarithm or the square root of a real matrix. It is known that for every real n x n matrix, A, if no real eigenvalue of A is negative or zero, then A has a real logarithm, that is,…

General Mathematics · Mathematics 2013-11-12 Jean Gallier

For any two n-th order polynomials a(s) and b(s), the Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial c(s) such that c(s)/a(s) and c(s)/b(s) are both strictly positive real.

Optimization and Control · Mathematics 2012-03-24 Long Wang

A linear operator on a finite dimensional nonzero real vector space may not have an eigenvalue. We define a related notion of a true-pair of a linear operator, and then show that each linear operator on a finite dimensional nonzero real…

General Mathematics · Mathematics 2021-06-21 Arindama Singh

Consider a real algebraic curve with set of real points $R\neq\emptyset$ and complexification $P\supset R$. Let $f$ be an algebraic function on $P$ with devisor of critical points $D\subset P$. We prove that $f$ is real after a…

Algebraic Geometry · Mathematics 2014-03-10 Sergey M. Natanzon

Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…

Algebraic Geometry · Mathematics 2021-01-01 Marco Besier , Dino Festi

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

Combinatorics · Mathematics 2021-03-08 Christos A. Athanasiadis , Eleni Tzanaki

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

Classical Analysis and ODEs · Mathematics 2020-07-02 Codruţ Grosu , Corina Grosu

An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…

Commutative Algebra · Mathematics 2020-04-02 Sophie Frisch , Sarah Nakato

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

Number Theory · Mathematics 2007-05-23 Jack Sonn

Analysing the cubic sectors of a real polynomial of degree n, a modification of the Newton Rule is Signs is proposed with which stricter upper bound on the number of real roots can be found. A new necessary condition for reality of the…

General Mathematics · Mathematics 2023-02-07 Emil M. Prodanov

With every real polynomial $f$, we associate a family $\{f_{\epsilon r}\}_{\epsilon, r}$ of real polynomials, in explicit form in terms of $f$ and the parameters $\epsilon>0,r\in N$, and such that $\Vert f-f_{\epsilon r}\Vert_1\to 0$ as…

Algebraic Geometry · Mathematics 2007-05-23 Jean B. Lasserre

We consider the set $\Pi ^*_d$ of monic polynomials $Q_d=x^d+\sum _{j=0}^{d-1}a_jx^j$, $x\in \mathbb{R}$, $a_j\in \mathbb{R}^*$, having $d$ distinct real roots, and its subsets defined by fixing the signs of the coefficients $a_j$. We show…

Classical Analysis and ODEs · Mathematics 2022-03-16 Vladimir Petrov Kostov

For the general monic cubic and quartic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities…

Commutative Algebra · Mathematics 2018-01-10 Elias Gonzalez , David A. Weinberg

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

Symbolic Computation · Computer Science 2019-11-18 Rémi Imbach , Victor Y. Pan
‹ Prev 1 3 4 5 6 7 10 Next ›