Related papers: Polyhedral Methods for Space Curves Exploiting Sym…
The real radical ideal of a system of polynomials with finitely many complex roots is generated by a system of real polynomials having only real roots and free of multiplicities. It is a central object in computational real algebraic…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
This paper introduces some inverse sequences of different polyhedra all based on finite approximations of a compact metric space so they can be used to capture the shape type of the original space. It is shown that they are HPol-expansions,…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
We study the use of polyhedral discretizations for the solution of heat diffusion and elastodynamic problems in computer graphics. Polyhedral meshes are more natural for certain applications than pure triangular or quadrilateral meshes,…
We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…
We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…
We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…
Tropical roots of tropical polynomials have been previously studied and used to localize roots of classical polynomials and eigenvalues of matrix polynomials. We extend the theory of tropical roots from tropical polynomials to tropical…
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to…
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…
We review three different approaches to polynomial symmetry algebras underlying superintegrable systems in Darboux spaces. The first method consists of using deformed oscillator algebra to obtain finite-dimensional representations of…
We study nonnegative and sums of squares symmetric (and even symmetric) functions of fixed degree. We can think of these as limit cones of symmetric nonnegative polynomials and symmetric sums of squares of fixed degree as the number of…
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…
One way of constructing explicit expressions of solutions of integrable systems of Partial Differential Equations (PDEs) goes via the Darboux method. This requires the construction of Darboux matrices. Here we introduce a novel algorithm to…
A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvatal's analysis of the greedy algorithm for the weighted set cover problem. The…
We point out how to use the classical characteristic method, that is used to solve quasilinear PDE's, to obtain the matrix exponential of some lower triangle infinite matrices. We use the Lie Frechet structure of the Riordan group described…