Related papers: Refining Multivariate Value Set Bounds
We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…
Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longer…
In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin,…
We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…
Positive and negative quadratic forms are well known and widely used. They are multivariate homogeneous polynomials of degree two taking positive or negative values respectively for any values of their arguments not all zero. In the present…
We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…
By defining multiplicities for zeros of polynomials over hyperfields, Baker and Lorscheid were able to provide a unifying perspective on Descartes's rule and the Newton polygon rule for polynomials over a formally-real and valued field…
One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…
If E is a locally convex topological vector space, let P(E) be the pre-ordered set of all continuous seminorms on E. We study, on the one hand, for g an infinite cardinal those locally convex spaces E which have the g-neighbourhood property…
We demonstrate counterexamples to Wilmshurst's conjecture on the valence of harmonic polynomials in the plane, and we conjecture a bound that is linear in the analytic degree for each fixed anti-analytic degree. Then we initiate a…
The A-polynomial of a manifold whose boundary consists of a single torus is generalised to an eigenvalue variety of a manifold whose boundary consists of a finite number of tori, and the set of strongly detected boundary curves is…
Using the Newton polytope and polyhedron, we study analytic spread and ideal reductions of monomial ideals. We determine a bound for analytic spread based on halfspaces and hyperplanes of the Newton polytope, and we classify basic monomial…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
We consider generalizations of parity polytopes whose variables, in addition to a parity constraint, satisfy certain ordering constraints. More precisely, the variable domain is partitioned into $k$ contiguous groups, and within each group,…
We consider multivariate polynomials and investigate how many zeros of multiplicity at least $r$ they can have over a Cartesian product of finite subsets of a field. Here r is any prescribed positive integer and the definition of…
In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…
It is shown that when in a higher order variational principle one fixes fields at the boundary leaving the field derivatives unconstrained, then the variational principle (in particular the solution space) is not invariant with respect to…
We give formulas and effective sharp bounds for the degree of multi-graded rational maps and provide some effective and computable criteria for birationality in terms of their algebraic and geometric properties. We also extend the Jacobian…