Related papers: Sparse Nullstellensatz, resultants and determinant…
We consider the sparse polynomial approximation of a multivariate function on a tensor product domain from samples of both the function and its gradient. When only function samples are prescribed, weighted $\ell^1$ minimization has recently…
In this paper, we give a sharp sparse domination of pseudodifferential operators associated with symbols belonging to the H\"{o}rmander class, and fundamental solutions of dispersive equations. Furthermore, we give boundedness results of…
We prove constructively a Nullstellensatz giving an equivalence between the existence of a certain kind of algebraic identity on one hand, and the impossibility of finding an increasing sequence of irreducible varieties obeying certain…
This paper is concerned with the problem of approximating the determinant of A for a large sparse symmetric positive definite matrix A. It is shown that an efficient solution of this problem is obtained by using a sparse approximate inverse…
Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding…
We give upper bounds for the determinant of an $n\times n$ zero-one matrix containing $kn$ ones for integral $k$. Our results improve upon a result of Ryser for $k=o(n^{1/3})$. For fixed $k\ge 3$ it was an open question whether Hadamard's…
The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem…
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 establish spectral convergence results of approximations of unbounded non-selfadjoint linear operators with compact resolvents by operators that converge in generalized strong resolvent sense. The aim is to establish general assumptions…
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,…
Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved $\ell_0$ norm. In this paper, a special type of tensor complementarity problems with…
For an ergodic measure preserving action on a probability space, consider the corresponding crossed product von Neumann algebra. We calculate the Fuglede-Kadison determinant for a class of operators in this von Neumann algebra in terms of…
In this paper we show, how a straightforward and natural application of a pair of fundamental identities valid for polynomials orthogonal over the unit circle, can be used to calculate the determinant of the finite Toeplitz matrix, $$…
We investigate determinants of Koszul complexes of holomorphic functions of a commuting tuple of bounded operators acting on a Hilbert space. Our main result shows that the analytic joint torsion, which compares two such determinants, can…
We prove a factorization formula for the Taylor series coefficients of a zero of a polynomial as a function of the polynomial's coefficients. This result extends to more general functions which we call "complex-exponent polynomials". To…
Given a sequence $(\xi_n)$ of standard i.i.d complex Gaussian random variables, Peres and Vir\'ag (in the paper ``Zeros of the i.i.d. Gaussian power series: a conformally invariant determinantal process'' {\it Acta Math.} (2005) 194, 1-35)…
We prove that truncations of nonstandard graded polynomial rings are (nonstandard) Koszul modules in the sense of Herzog and Iyengar. This provides an analogue of the fact that such truncations have linear resolutions in the standard graded…
We prove norm estimates for the difference of resolvents of operators and their discrete counterparts, embedded into the continuum using biorthogonal Riesz sequences. The estimates are given in the operator norm for operators on square…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
Using results of Fayers on the structure of Specht modules, we prove two different formulae for the determinant of matrices which are obtained by amalgamating the entries of two smaller matrices. In particular, this gives formulae for…