Related papers: Sparse Nullstellensatz, resultants and determinant…

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 present a parametric deterministic formulation of Bayesian inverse problems with input parameter from infinite dimensional, separable Banach spaces. In this formulation, the forward problems are parametric, deterministic elliptic partial…

Grigoriev and Podolskii (2018) have established a tropical analogue of the effective Nullstellensatz, showing that a system of tropical polynomial equations is solvable if and only if a linearized system obtained from a truncated Macaulay…

Resultants are important special functions used in description of non-linear phenomena. Resultant $R_{r_1, ..., r_n}$ defines a condition of solvability for a system of $n$ homogeneous polynomials of degrees $r_1, ..., r_n$ in $n$…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with…

A finitely generated module over the ring L=Z[t, t^{-1}] of integer Laurent polynomials that has no Z-torsion is determined by a pair of sub-lattices of L^d. Their indices are the absolute values of the leading and trailing coefficients of…

We establish a character formula for indecomposable tilting modules for connected reductive groups in characteristic p in terms of p-Kazhdan-Lusztig polynomials, for p>h the Coxeter number. Using results of Andersen, one may deduce a…

The existence of linear differential resolvents for z^alpha for any root z of an ordinary polynomial with coefficients in a given ordinary differential field has been established, where alpha is an indeterminate constant with respect to the…

From a transfer formula in multivariate finite operator calculus, comes an expansion for the determinant similar to Ryser's formula for the permanent. Although this one contains many more terms than the usual determinant formula. To prove…

The purpose of this paper is to compute the asymptotics of determinants of finite sections of operators that are trace class perturbations of Toeplitz operators. For example, we consider the asymptotics in the case where the matrices are of…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

We present an upper bound for the height of the mixed sparse resultant, defined as the logarithm of the maximum modulus of its coefficients. We obtain a similar estimate for its Mahler measure.

One can recover sparse multivariate trigonometric polynomials from few randomly taken samples with high probability (as shown by Kunis and Rauhut). We give a deterministic sampling of multivariate trigonometric polynomials inspired by…

In this paper, we develop two variants of Bezout subresultant formulas for several polynomials, i.e., hybrid Bezout subresultant polynomial and non-homogeneous Bezout subresultant polynomial. Rather than simply extending the variants of…

Algorithms for Gaussian process, marginal likelihood methods or restricted maximum likelihood methods often require derivatives of log determinant terms. These log determinants are usually parametric with variance parameters of the…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

We introduce an algebraic model, based on the determinantal expansion of the product of two matrices, to test combinatorial reductions of set functions. Each term of the determinantal expansion is deformed through a monomial factor in d…

Many computer vision applications require robust and efficient estimation of camera geometry from a minimal number of input data measurements, i.e., solving minimal problems in a RANSAC framework. Minimal problems are usually formulated as…

We study how to estimate a nearly low-rank Toeplitz covariance matrix $T$ from compressed measurements. Recent work of Qiao and Pal addresses this problem by combining sparse rulers (sparse linear arrays) with frequency finding (sparse…