We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of distinct monomials for dimensions 2 and 3. We study the connection with monomial CR maps of hyperquadrics and prove similar bounds in this setup with emphasis on the case of spheres. The results support generalizing a conjecture on the degree bounds to the more general case of hyperquadrics. Keywords. Polynomials constant on a hyperplane, CR mappings of spheres and hyperquadrics, monomial mappings, degree estimates, Newton diagram. 2000 Mathematics Subject Classification. 14P99, 05A20, 32H35, 11C08
AbstractThe main goal of this paper is to present an algorithm bounding the dimension of a linear sy...
We present an algebraic approach to the classical problem of constructing a simplicial convex polyto...
We investigate the uniform approximation provided by least squares polynomials on the unit Euclidean...
Abstract. We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number...
Dedicated to Professor John P. D’Angelo on the occasion of his sixtieth birthday. Abstract. We prove...
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of s...
Abstract. Associated to any hypergraph is a toric ideal encoding the algebraic relations among its e...
We study canonical heights for plane polynomial mappings of small topological degree. In particul...
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in th...
In this new version some references are added for Thom-Sebastiani type results for the productof two...
We prove a separation between monotone and general arithmetic formulas for polynomials of constant d...
In this dissertation, we determine best-to-date upper bounds on the resolvent degree of solving gene...
The Monodromy Conjecture asserts that if c is a pole of the local topological zeta function of a hyp...
Abstract. In 1958 Lax conjectured that hyperbolic polynomials in three vari-ables are determinants o...
AbstractWe prove the following finite jet determination result for CR mappings: Given a smooth gener...
AbstractThe main goal of this paper is to present an algorithm bounding the dimension of a linear sy...
We present an algebraic approach to the classical problem of constructing a simplicial convex polyto...
We investigate the uniform approximation provided by least squares polynomials on the unit Euclidean...
Abstract. We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number...
Dedicated to Professor John P. D’Angelo on the occasion of his sixtieth birthday. Abstract. We prove...
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of s...
Abstract. Associated to any hypergraph is a toric ideal encoding the algebraic relations among its e...
We study canonical heights for plane polynomial mappings of small topological degree. In particul...
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in th...
In this new version some references are added for Thom-Sebastiani type results for the productof two...
We prove a separation between monotone and general arithmetic formulas for polynomials of constant d...
In this dissertation, we determine best-to-date upper bounds on the resolvent degree of solving gene...
The Monodromy Conjecture asserts that if c is a pole of the local topological zeta function of a hyp...
Abstract. In 1958 Lax conjectured that hyperbolic polynomials in three vari-ables are determinants o...
AbstractWe prove the following finite jet determination result for CR mappings: Given a smooth gener...
AbstractThe main goal of this paper is to present an algorithm bounding the dimension of a linear sy...
We present an algebraic approach to the classical problem of constructing a simplicial convex polyto...
We investigate the uniform approximation provided by least squares polynomials on the unit Euclidean...