相关论文: A criterion for positive polynomials

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

Let $f,g_1,\dots,g_m$ be polynomials of degree at most $d$ with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Assume that $f$ is non-negative on a basic semi-algebraic set $S$ defined by polynomial inequalities $g_j(x)\ge…

We present a necessary and sufficient condition for the separability of multipartite quantum states, this criterion also tells us how to write a multipartite separable state as a convex sum of separable pure states. To work out this…

In this paper, we mainly dicuss the non-negativity conditions for quartic homogeneous polynomials with 3 variables, which is the analytic conditions of copositivity of a class of 4th order 3-dimensional symmetric tensors. For a 4th order…

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…

We give a criterion for a real divisor to be rational and semiample.

A bad point of a positive semidefinite real polynomial f is a point at which a pole appears in all expressions of f as a sum of squares of rational functions. We show that quartic polynomials in three variables never have bad points. We…

Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Let \psi(x) be a polynomial with rational coefficients. Suppose that \psi has the positive leading coefficient and zero constant term. Let A be a set of positive integers with the positive upper density. Then there exist x,y\in A and a…

Inspired by the work of Bhatt and Singh (see: arXiv:1307.1171) we compute the $F$-pure threshold of quasi-homogeneous polynomials. We first consider the case of a curve given by a quasi-homogeneous polynomial $f$ in three variables $x,y,z$…

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.

We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

Suppose E/F is a field extension. We ask whether or not there exists an element of E whose characteristic polynomial has one or more zero coefficients in specified positions. We show that the answer is frequently ``no''. We also prove…

The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…

We determine a precise necessary and sufficient condition for completeness of the Hamiltonian vector field associated to a homogeneous cubic polynomial on a symplectic plane.

Boolean satisfiability problem has applications in various fields. An efficient algorithm to solve satisfiability problem can be used to solve many other problems efficiently. The input of satisfiability problem is a finite set of clauses.…