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

We discuss a cheap tetrahedra-free approach to the numerical integration of polynomials on polyhedral elements, based on hyperinterpolation in a bounding box and Chebyshev moment computation via the divergence theorem. No conditioning…

This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…

The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…

We consider bivariate piecewise polynomial finite element spaces for curved domains bounded by piecewise conics satisfying homogeneous boundary conditions, construct stable local bases for them using Bernstein-B\'ezier techniques, prove…

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…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Automating the solutions of multiple network information theory problems, stretching from fundamental concerns such as determining all information inequalities and the limitations of linear codes, to applied ones such as designing coded…

We describe a new sequence of polytopes which characterize A_infinity maps from a topological monoid to an A_infinity space. Therefore each of these polytopes is a quotient of the corresponding multiplihedron. Later term(s) in our sequence…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…

In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques…

Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…

This paper is a study of the polyhedral geometry of Gelfand-Tsetlin patterns arising in the representation theory $\mathfrak{gl}_n \C$ and algebraic combinatorics. We present a combinatorial characterization of the vertices and a method to…

The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…

The nonlinear integral equation P(x)=\int_alpha^beta dy w(y) P(y) P(x+y) is investigated. It is shown that for a given function w(x) the equation admits an infinite set of polynomial solutions P(x). For polynomial solutions, this nonlinear…

R. M. Brown's theorem on mixed Dirichlet and Neumann boundary conditions is extended in two ways for the special case of polyhedral domains. A (1) more general partition of the boundary into Dirichlet and Neumann sets is used on (2)…

A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…

We prove a version of the Bernstein-Walsh theorem on uniform polynomial approximation of holomorphic functions on compact sets in several complex variables. Here we consider subclasses of the full polynomial space associated to a convex…