Related papers: Elimination for generic sparse polynomial systems
We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the…
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…
This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…
It is known how to compute the Zariski closure of a finitely generated monoid of matrices and, more generally, of a set of matrices specified by a regular language. This result was recently used to give a procedure to compute all polynomial…
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…
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…
We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral…
A positive definite matrix is called logarithmically sparse if its matrix logarithm has many zero entries. Such matrices play a significant role in high-dimensional statistics and semidefinite optimization. In this paper, logarithmically…
In this paper we investigate the intrinsic sequential time complexity of universal elimination procedures for arbitrary continuous data structures encoding input and output objects of elimination theory (i.e. polynomial equation systems)…
We consider families of sparse Laurent polynomials f_1,...,f_n with a finite set of common zeroes Z_f in the complex algebraic n-torus. The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over the…
We prove constructively the existence of surjective morphisms from affine space onto certain open subvarieties of affine space of the same dimension. For any algebraic set $Z\subset \mathbb{A}^{n-2}\subset \mathbb{A}^{n}$, we construct an…
We develop a sparse spectral method for a class of fractional differential equations, posed on $\mathbb{R}$, in one dimension. These equations can include sqrt-Laplacian, Hilbert, derivative and identity terms. The numerical method utilizes…
Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…
We present a method to compute the holonomic extension of a $D$-module from a Zariski open set in affine space to the whole space. A particular application is the localization of coherent $D$-modules which are holonomic on the complement of…
We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined…
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
The article demonstrates the procedure how to compute the Zariski closure of an orbit by an algebraic action of finitely generated group on the affine plane. First half of the algorithm is about deciding whether given finitely generated…
Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…
Let $F$ be a field, let $D$ be a subring of $F$, and let ${\mathfrak{X}}$ be the Zariski-Riemann space of valuation rings containing $D$ and having quotient field $F$. We consider the Zariski, inverse and patch topologies on…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…