English
Related papers

Related papers: A New Family of Nonnegative Sine Polynomials

200 papers

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

Number Theory · Mathematics 2019-08-23 Jitender Singh , Sanjeev Kumar

In an earlier article [3], we presented an algorithm that can be used to rigorously check whether a specific cosine or sine polynomial is nonnegative in a given interval or not. The algorithm proves to be an indispensable tool in…

Classical Analysis and ODEs · Mathematics 2015-07-06 Man Kam Kwong

The concept of sums of nonnegative circuit polynomials (SONC) was recently introduced as a new certificate of nonnegativity especially for sparse polynomials. In this paper, we explore the relationship between nonnegative polynomials and…

Combinatorics · Mathematics 2021-04-06 Jie Wang

A known characterization for entire functions that preserve all nonnegative matrices of order two is shown to characterize polynomials that preserve nonnegative matrices of order two. Equivalent conditions are derived and used to prove that…

Rings and Algebras · Mathematics 2022-05-03 Benjamin J. Clark , Pietro Paparella

Recently, the second and the third author developed sums of nonnegative circuit polynomials (SONC) as a new certificate of nonnegativity for real polynomials, which is independent of sums of squares. In this article we show that the SONC…

Algebraic Geometry · Mathematics 2017-03-20 Mareike Dressler , Sadik Iliman , Timo de Wolff

We initiate a systematic study of nonnegative polynomials $P$ such that $P^k$ is not a sum of squares for any odd $k\geq 1$, calling such $P$ \emph{stubborn}. We develop a new invariant of a real isolated zero of a nonnegative polynomial in…

Algebraic Geometry · Mathematics 2024-08-01 Grigoriy Blekherman , Khazhgali Kozhasov , Bruce Reznick

We completely characterize sections of the cones of nonnegative polynomials, convex polynomials and sums of squares with polynomials supported on circuits, a genuine class of sparse polynomials. In particular, nonnegativity is characterized…

Algebraic Geometry · Mathematics 2015-10-27 Sadik Iliman , Timo de Wolff

Every symmetric polynomial p(x)=p(x_1,...,x_g) (with real coefficients) in g noncommuting variables x_1, ..., x_g can be written as a sum and difference of squares of noncommutative polynomials. Let s(p), the negative signature of p, denote…

Functional Analysis · Mathematics 2009-03-12 Harry Dym , Jeremy M. Greene , J. William Helton , Scott A. McCullough

In this paper, we give an explicit expression for a certain family of ternary cyclotomic polynomials: specifically $\Phi_{p_{1}p_{2}p_{3}}$, where $p_{1}<p_{2}<p_{3}$ are odd primes such that $p_{2} \equiv1 \mod p_{1}$ and $p_{3} \equiv1…

Number Theory · Mathematics 2018-01-18 Ala'a Al-Kateeb , Hoon Hong , Eunjeong Lee

In this note we introduce a new class of refined Eulerian polynomials defined by $$A_n(p,q)=\sum_{\pi\in\mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)},$$ where ${\rm odes}(\pi)$ and ${\rm edes}(\pi)$ enumerate the number of descents…

Combinatorics · Mathematics 2018-05-22 Hua Sun

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

Optimization and Control · Mathematics 2012-10-26 Tomáš Kepka , Miroslav Korbelář

A SONC polynomial is a sum of finitely many non-negative circuit polynomials, whereas a non-negative circuit polynomial is a non-negative polynomial whose support is a simplicial circuit. We show that there exist non-negative polynomials…

Optimization and Control · Mathematics 2021-08-05 Gennadiy Averkov

Four families of generalizations of trigonometric functions were recently introduced. In the paper the functions are transformed into four families of orthogonal polynomials depending on two variables. Recurrence relations for construction…

Mathematical Physics · Physics 2015-03-17 Lenka Motlochova , Jiri Patera

We introduce a new family of orthogonal polynomials on the disk that has emerged in the context of wave propagation in layered media. Unlike known examples, the polynomials are orthogonal with respect to a measure all of whose even moments…

Classical Analysis and ODEs · Mathematics 2015-03-19 Peter C. Gibson

In this paper, we prove that every SONC polynomial decomposes into a sum of nonnegative circuit polynomials with the same support, which reveals the advantage of SONC decompositions for certifying nonnegativity of sparse polynomials…

Combinatorics · Mathematics 2018-11-27 Jie Wang

In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…

Number Theory · Mathematics 2023-11-28 Jitender Singh , Sanjeev Kumar

We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic subset K of Rn. Namely, they belong to a specific subset of the quadratic module generated by the…

Algebraic Geometry · Mathematics 2008-07-09 Jean B. Lasserre

The question of how to certify the non-negativity of a polynomial function lies at the heart of Real Algebra and it also has important applications to Optimization. In the setting of symmetric polynomials Timofte provided a useful way of…

Optimization and Control · Mathematics 2015-10-21 Cordian Riener

In this paper we focus on two new families of polynomials which are connected with exponential polynomials and geometric polynomials. We discuss their generalizations and show that these new families of polynomials and their generalizations…

Number Theory · Mathematics 2010-02-03 Ayhan Dil , Veli Kurt

A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.

Number Theory · Mathematics 2013-07-01 T. D. Browning
‹ Prev 1 2 3 10 Next ›