Related papers: High Probability Analysis of the Condition Number …

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

We give asymptotic large deviations estimates for the volume inside a domain U of the zero set of a random polynomial of degree N, or more generally, of a holomorphic section of the N-th power of a positive line bundle on a compact Kaehler…

Consider a random system $\mathfrak{f}_1(x)=0,\ldots,\mathfrak{f}_n(x)=0$ of $n$ random real polynomials in $n$ variables, where each $\mathfrak{f}_k$ has a prescribed set of exponent vectors in a set $A_k\subseteq \mathbb{Z}^n$ of size…

We consider the sensitivity of real roots of polynomial systems with respect to perturbations of the coefficients. In particular - for a version of the condition number defined by Cucker, Krick, Malajovich, and Wschebor - we establish new…

We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood degree counts the number of critical points of the likelihood function restricted to the…

Condition numbers of random polynomial systems have been widely studied in the literature under certain coefficient ensembles of invariant type. In this note we introduce a method that allows us to study these numbers for a broad family of…

We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…

The Mahler measure of a polynomial is a measure of complexity formed by taking the modulus of the leading coefficient times the modulus of the product of its roots outside the unit circle. The roots of a real degree $N$ polynomial chosen…

The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. Among the challenges that it poses is to expand the currently limited range of random polynomials…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

We derive upper bounds on the tail conditional expectation of binomial and Poisson random variables. Those upper bounds are subsequently employed to the problem of obtaining non-asymptotic lower bounds on the probability that the…

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes, stochastic context-free grammars,…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

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,…

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

Given a polynomial function $f \colon \mathbb{R}^n \rightarrow \mathbb{R}$ and a unbounded basic closed semi-algebraic set $S \subset \mathbb{R}^n,$ in this paper we show that the conditions listed below are characterized exactly in terms…

Let $P_1,\dots, P_n$ and $Q_1,\dots, Q_n$ be convex polytopes in $\mathbb{R}^n$ such that $P_i\subset Q_i$. It is well-known that the mixed volume has the monotonicity property: $V(P_1,\dots,P_n)\leq V(Q_1,\dots,Q_n)$. We give two criteria…

In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…