Related papers: A Note on Property Testing Sum of Squares and Mult…
In approximation of functions based on point values, least-squares methods provide more stability than interpolation, at the expense of increasing the sampling budget. We show that near-optimal approximation error can nevertheless be…
We study the quantitative relationship between the cones of nonnegative polynomials, cones of sums of squares and cones of sums of powers of linear forms. We derive bounds on the volumes (raised to the power reciprocal to the ambient…
We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…
Given rational univariate polynomials f and g such that gcd(f, g) and f / gcd(f, g) are relatively prime, we show that g is non-negative on all the real roots of f if and only if g is a sum of squares of rational polynomials modulo f. We…
We find a formula, in terms of n, d and p, for the value of the F-pure threshold for the generic homogeneous polynomial of degree d in n variables over an algebraically closed field of characteristic p. We also show that, in every…
We give an example of a polynomial of degree 4 in 5 variables that is the sum of squares of 8 polynomials and cannot be decomposed as the sum of 7 squares. This improves the current existing lower bound of 7 polynomials for the Pythagoras…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
We study real bihomogeneous polynomials $r(z,\bar{z})$ in $n$ complex variables for which $r(z,\bar{z}) \|z\|^2$ is the squared norm of a holomorphic polynomial mapping. Such polynomials are the focus of the Sum of Squares Conjecture, which…
Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…
Let X be a real nondegenerate projective subvariety such that its set of real points is Zariski dense. We prove that every real quadratic form that is nonnegative on X is a sum of squares of linear forms if and only if X is a variety of…
Interpolation based software model checkers have been successfully employed to automatically prove programs correct. Their power comes from interpolating SMT solvers that check the feasibility of potential counterexamples and compute…
We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These…
Our interest is whether two binomial parameters differ, which parameter is larger, and by how much. This apparently simple problem was addressed by Fisher in the 1930's, and has been the subject of many review papers since then. Yet there…
We study sampling and interpolation arrays with multiplicities for the spaces P_k of holomorphic polynomials of degree at most k. We find that the geometric conditions satisfied by these arrays are in accordance with the conditions…
In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
For a probability measure on a real separable Hilbert space, we are interested in "volume-based" approximations of the d-dimensional least squares error of it, i.e., least squares error with respect to a best fit d-dimensional affine…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
For any given positive integer $m$ we construct certain totally positive algebraic integers $\alpha$ of a real bi-quadratic field $K$ and obtain some necessary conditions for which $m\alpha$ can not be represented as sum of integral…
We show that any symmetric positive definite homogeneous matrix polynomial $M\in\R[x_1,...,x_n]^{m\times m}$ admits a piecewise semi-certificate, i.e. a collection of identites $M(x)=\sum_jf_{i,j}(x)U_{i,j}(x)^TU_{i,j}(x)$ where…