相关论文: Why Polyhedra Matter in Non-Linear Equation Solvin…

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…

We design new tools to study variants of Total Dual Integrality. As an application, we obtain a geometric characterization of Total Dual Integrality for the case where the associated polyhedron is non-degenerate. We also give sufficient…

We prove a strongly polynomial bound on the circuit diameter of polyhedra, resolving the circuit analogue of the polynomial Hirsch conjecture. Specifically, we show that the circuit diameter of a polyhedron $P = \{x\in \mathbb{R}^n:\, A x =…

Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…

For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed…

Motivated by the analysis of the performance of the simplex method we study the behavior of families of pivot rules of linear programs. We introduce normalized-weight pivot rules which are fundamental for the following reasons: First, they…

We consider the set of the power non-negative polynomials of several variables and its subset that consists of polynomials which can be represented as a sum of squares. It is shown in the classic work by D.Hilbert that it is a proper…

A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the…

The main results of this paper interpret mixed volumes of lattice polytopes as mixed multiplicities of ideals and mixed multiplicities of ideals as Samuel's multiplicities. In particular, we can give a purely algebraic proof of Bernstein's…

In this paper we establish some applications of the Scherer-Hol's theorem for polynomial matrices. Firstly, we give a representation for polynomial matrices positive definite on subsets of compact polyhedra. Then we establish a…

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…

Nonlinear approximation from regular piecewise polynomials (splines) of degree $<k$ supported on rings in $\R^2$ is studied. By definition a ring is a set in $\R^2$ obtained by subtracting a compact convex set with polygonal boundary from…

In their seminal paper, Berman and Boucksom exploited ideas from complex geometry to analyze asymptotics of spaces of holomorphic sections of tensor powers of certain line bundles $L$ over compact, complex manifolds as the power grows. This…

We extend previous results about Putinar's Positivstellensatz for cylinders of type $S \times {\mathbb R}$ to sets of type $S \times {\mathbb R}^r$ in some special cases taking into account $r$ and the degree of the polynomial with respect…

In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate…

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…

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

We study the problem of binary classification from the point of view of learning convex polyhedra in Hilbert spaces, to which one can reduce any binary classification problem. The problem of learning convex polyhedra in finite-dimensional…

Given the projections of two semialgebraic sets defined by polynomial matrix inequalities, it is in general difficult to determine whether one is contained in the other. To address this issue we propose a new matrix Positivstellensatz that…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…