Related papers: Compatible polynomials and edgewise subdivisions

In this paper we show that a polynomial equation admits infinitely many prime-tuple solutions assuming only that the equation satisfies suitable local conditions and the polynomial is sufficiently non-degenerate algebraically. Our notion of…

In this article we prove that the adjoint polynomial of arbitrary convex polytopes is up to scaling uniquely determined by vanishing to the right order on the polytopes residual arrangement. This answers a problem posed by Kohn and Ranestad…

The zero set of a real polynomial in two variable is a curve in $\mathbb R^2$. For a generic choice of its coefficients this is a non-singular curve, a collection of circles and lines properly embedded in $\mathbb R^2$. What topological…

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…

For a given real polynomial $p$ we study the possible number of real roots of a differential polynomial $H_{\varkappa}[p](x) = \varkappa\left(p'(x)\right)^2-p(x)p''(x), \varkappa \in \mathbb{R}.$ In the special case when all real zeros of…

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

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…

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

We prove that a generic homogeneous polynomial of degree $d$ is determined, up to a nonzero constant multiplicative factor, by the vector space spanned by its partial derivatives of order $k$ whenever $k\leq\frac{d}{2}-1$.

In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots $x_1,x_2,x_3$ (enumerated in some order) are real. There exists (and only one)…

In a recent work (Int Math Res Not 24:18604-18612, 2021), Carlen-Jauslin-Lieb-Loss studied the convolution inequality $f \ge f*f$ on $\mathbb{R}^d$ and proved that the real integrable solutions of the above inequality must be non-negative…

In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich's and Nourein's iterations. Our theorems generalize and improve…

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…

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…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

A polynomial is real-rooted if all of its roots are real. This note gives a simple proof of the Hermite-Sylvester theorem that a polynomial $f(x) \in {\mathbf R}[x]$ is real-rooted if and only if an associated quadratic form is positive…

The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…

Hyperbolic polynomials are real multivariate polynomials with only real roots along a fixed pencil of lines. Testing whether a given polynomial is hyperbolic is a difficult task in general. We examine different ways of translating…