Testing Sign Conditions on a Multivariate Polynomial and Applications
نویسندگان
چکیده
منابع مشابه
Testing Sign Conditions on a Multivariate Polynomial and Applications
Let f be a polynomial in Q[X1, . . . , Xn] of degree D. We focus on testing the emptiness and computing at least one point in each connected component of the semi-algebraic set defined by f > 0 (or f < 0 or f 6= 0). To this end, the problem is reduced to computing at least one point in each connected component of a hypersurface defined by f −e = 0 for e ∈ Q positive and small enough. We provide...
متن کاملOn sign conditions over real multivariate polynomials
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that intersect transversally. This enables us to show a probabilistic procedure to list all feasible sign conditions. We extend our main algorithm to the case of an...
متن کاملOn multivariate polynomial interpolation
We provide a map Θ 7→ ΠΘ which associates each finite set Θ of points in C with a polynomial space ΠΘ from which interpolation to arbitrary data given at the points in Θ is possible and uniquely so. Among all polynomial spaces Q from which interpolation at Θ is uniquely possible, our ΠΘ is of smallest degree. It is also Dand scale-invariant. Our map is monotone, thus providing a Newton form for...
متن کاملTesting multivariate uniformity and its applications
Some new statistics are proposed to test the uniformity of random samples in the multidimensional unit cube [0, 1]d (d ≥ 2). These statistics are derived from number-theoretic or quasi-Monte Carlo methods for measuring the discrepancy of points in [0, 1]d. Under the null hypothesis that the samples are independent and identically distributed with a uniform distribution in [0, 1]d, we obtain som...
متن کاملA Note on Property Testing Sum of Squares and Multivariate Polynomial Interpolation
In this paper, we investigate property testing whether or not a degree d multivariate polynomial is a sum of squares or is far from a sum of squares. We show that if we require that the property tester always accepts YES instances and uses random samples, nΩ(d) samples are required, which is not much fewer than it would take to completely determine the polynomial. To prove this lower bound, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics in Computer Science
سال: 2007
ISSN: 1661-8270,1661-8289
DOI: 10.1007/s11786-007-0003-9