Related papers: Complexity of sparse polynomial solving 3: Infinit…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
The goal of this paper is to study the path-following method for univariate polynomials. We propose to study the complexity and condition properties when the Newton method is applied as a correction operator. Then we study the geodesics and…
We discuss an experimental approach to open problems in toric geometry: are smooth projective toric varieties (i) projectively normal and (ii) defined by degree 2 equations? We discuss the creation of lattice polytopes defining smooth toric…
We study methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy based solvers in terms of decorated graphs. Under the…
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…
We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These take advantage of Anderson's flat degeneration to a toric variety. When Anderson's…
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…
We consider the problem of deciding whether the solution sets of a parametrized polynomial system are toric in the sense that they admit a monomial parametrization. We focus on vertically parametrized systems, which are sparse systems where…
We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate plans for the class 3S of planning problems with binary state…
Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector…
On complex algebraic varieties, height functions arising in combinatorial applications fail to be proper. This complicates the description and computation via Morse theory of key topological invariants. Here we establish checkable…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
This note proves the existence of universal rational parametrizations. The description involves homogeneous coordinates on a toric variety coming from a lattice polytope. We first describe how smooth toric varieties lead to universal…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and…
The aim of homotopy theory in topology is to simplify, after continuous deformation, continuous maps between topological spaces. What prevents this from happening are homotopy invariants. This raises quantitative questions: $\bullet$ Is the…
The purpose of this paper is to study the topology of certain toric varieties $X_I$, arising as quotients of the action of $\C^*$ on complements of arrangements of coordinate subspaces in $\C^n$, and to improve the homotopy stability…