Related papers: Dimension Results for Extremal-Generic Polynomial …
We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…
We construct the algebraic cobordism theory of bundles and divisors on smooth varieties. It has a simple basis (over Q) from projective spaces and its rank is equal to the number of Chern invariants. As an application we study the number of…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
We present an algebraic method to study four-dimensional toric varieties by lifting matrix equations from the special linear group ${\rm SL}_2({\mathbb Z})$ to its preimage in the universal cover of ${\rm SL}_2({\mathbb R})$. With this…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…
We describe the generic modules in each component of the spaces of representations of certain string algebras. In so doing, we calculate the dimensions of higher self-extension groups for generic modules. This algorithm lends itself for use…
We consider the problem of stable sampling of multivariate real polynomials of large degree in a general framework where the polynomials are defined on an affine real algebraic variety $M$, equipped with a weighted measure. In particular,…
In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem and Eigenvector…
We investigate a version of Viro's method for constructing polynomial systems with many positive solutions, based on regular triangulations of the Newton polytope of the system. The number of positive solutions obtained with our method is…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We consider linear systems on toric varieties of any dimension, with invariant base points, giving a characterization of special linear systems. We then make a new conjecture for linear systems on rational surfaces.
This paper aims at studying how finitely many generalized polarization tensors of an algebraic domain can be used to determine its shape. Precisely, given a planar set with real algebraic boundary, it is shown that the minimal polynomial…
Let $X_P$ be a smooth projective toric variety of dimension $n$ embedded in $\PP^r$ using all of the lattice points of the polytope $P$. We compute the dimension and degree of the secant variety $\Sec X_P$. We also give explicit formulas in…
Differential resultant formulas are defined, for a system $\mathcal{P}$ of $n$ ordinary Laurent differential polynomials in $n-1$ differential variables. These are determinants of coefficient matrices of an extended system of polynomials…
In this paper, we propose a general sparse decomposition of dynamical systems provided that the vector field and constraint set possess certain sparse structures, which we call subsystems. This notion is based on causal dependence in the…
Recently, sparsity-based algorithms are proposed for super-resolution spectrum estimation. However, to achieve adequately high resolution in real-world signal analysis, the dictionary atoms have to be close to each other in frequency,…
In earlier papers it was shown that the generic tropical variety of an ideal can contain information on algebraic invariants as for example the depth in a direct way. The existence of generic tropical varieties has so far been proved in the…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…