English
Related papers

Related papers: Three realization problems about univariate polyno…

200 papers

We prove that there is an absolute constant $c > 0$ such that every polynomial $P$ of the form $$P(z) = \sum_{j=0}^{n}{a_jz^j}\,, \quad |a_0| = 1\,, \quad |a_j| \leq M\,, \quad a_j \in \Bbb{C}\,, \quad M \geq 1\,,$$ has at most…

Classical Analysis and ODEs · Mathematics 2024-10-15 Tamás Erdélyi

Pourchet proved in 1971 that every nonnegative univariate polynomial with rational coefficients is a sum of five or fewer squares. Nonetheless, there are no known algorithms for constructing such a decomposition. The sole purpose of the…

Symbolic Computation · Computer Science 2023-02-07 Victor Magron , Przemysław Koprowski , Tristan Vaccon

The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…

Algebraic Geometry · Mathematics 2019-11-19 Macarena Ansola , Antonio Díaz-Cano , M. Angeles Zurro

We consider the equation $P(Q(x_1,\ldots,x_\nu))=Q(P(x_1),\ldots,P(x_\nu))$ in polynomials over the field of complex numbers and prove that if ${\rm deg}(P)>1$, then it is only solvable in polynomials that are affinely conjugate to…

Number Theory · Mathematics 2024-12-17 Arseny Mingajev

For a polynomial with palindromic coefficients, unimodality is equivalent to having a nonnegative $g$-vector. A sufficient condition for unimodality is having a nonnegative $\gamma$-vector, though one can have negative entries in the…

Combinatorics · Mathematics 2016-01-20 Charles Brittenham , Andrew Carroll , T. Kyle Petersen , Connor Thomas

We describe a new approach to certifying the global nonnegativity of multivariate polynomials by solving hyperbolic optimization problems---a class of convex optimization problems that generalize semidefinite programs. We show how to…

Optimization and Control · Mathematics 2019-10-07 James Saunderson

Viewing a bivariate polynomial f in R[x,t] as a family of univariate polynomials in t parametrized by real numbers x, we call f real rooted if this family consists of monic polynomials with only real roots. If f is the characteristic…

Algebraic Geometry · Mathematics 2016-10-24 Christoph Hanselka

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

Algebraic Geometry · Mathematics 2007-05-23 Martin Avendano

A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses…

Rings and Algebras · Mathematics 2021-06-03 Igor Klep , James Eldred Pascoe , Jurij Volčič

Our focus is upon {\it irreducible} nonnegative $n$-by-$n$ matrix realizations of nonnegatively realizable spectra or, equivalently, characteristic polynomials. After giving some general background, we make some useful new observations and…

Combinatorics · Mathematics 2026-05-25 C. R. Johnson , C. Marijuán , M. Pisonero

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

In further pursuit of a solution to the celebrated nonnegative inverse eigenvalue problem, Loewy and London [Linear and Multilinear Algebra 6 (1978/79), no.~1, 83--90] posed the problem of characterizing all polynomials that preserve all…

Rings and Algebras · Mathematics 2024-02-07 Benjamin J. Clark , Pietro Paparella

We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…

Classical Analysis and ODEs · Mathematics 2009-02-03 Diego Dominici , Kathy Driver , Kerstin Jordaan

Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…

Symbolic Computation · Computer Science 2023-10-05 Victor Magron , Mohab Safey El Din , Markus Schweighofer , Trung Hieu Vu

In this paper we study multivariate polynomial functions in complex variables and the corresponding associated symmetric tensor representations. The focus is on finding conditions under which such complex polynomials/tensors always take…

Optimization and Control · Mathematics 2016-02-23 Bo Jiang , Zhening Li , Shuzhong Zhang

The radical solution of polynomials with rational coefficients is a famous solved problem. This paper found that it is a $\mathbb{NP}$ problem. Furthermore, this paper found that arbitrary $ \mathscr{P} \in \mathbb{P}$ shall have a one-way…

Computational Complexity · Computer Science 2024-05-28 Bojin Zheng , Weiwu Wang

For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…

Numerical Analysis · Mathematics 2020-02-18 Bor Plestenjak

We study the case of a real homogeneous polynomial $P$ whose minimal real and complex decompositions in terms of powers of linear forms are different. We prove that, if the sum of the complex and the real ranks of $P$ is at most $…

Algebraic Geometry · Mathematics 2013-03-12 Edoardo Ballico , Alessandra Bernardi

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

We study sign symmetric $P_{0,1}^+$-matrix completion problem. It is shown that any non-asymmetric incomplete digraph lacks sign symmetric $P_{0,1}^+$-completion, digraphs of order at most four are completely classified and finally…

Combinatorics · Mathematics 2024-05-30 Victor Tomno , Linety Muhati
‹ Prev 1 4 5 6 7 8 10 Next ›